/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.07.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:40:25,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:40:25,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:40:25,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:40:25,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:40:25,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:40:25,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:40:25,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:40:25,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:40:25,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:40:25,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:40:25,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:40:25,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:40:25,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:40:25,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:40:25,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:40:25,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:40:25,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:40:25,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:40:25,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:40:25,141 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:40:25,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:40:25,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:40:25,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:40:25,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:40:25,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:40:25,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:40:25,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:40:25,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:40:25,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:40:25,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:40:25,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:40:25,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:40:25,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:40:25,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:40:25,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:40:25,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:40:25,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:40:25,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:40:25,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:40:25,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:40:25,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:40:25,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:40:25,164 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:40:25,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:40:25,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:40:25,165 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:40:25,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:40:25,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:40:25,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:40:25,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:40:25,166 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:40:25,166 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:40:25,166 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:40:25,167 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:40:25,167 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:40:25,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:40:25,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:40:25,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:40:25,167 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:40:25,167 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:40:25,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:40:25,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:40:25,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:40:25,167 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:40:25,167 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:40:25,168 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:40:25,168 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:40:25,168 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:40:25,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:40:25,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:40:25,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:40:25,360 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:40:25,361 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:40:25,362 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.07.i.cil-1.c [2022-04-08 08:40:25,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5ad9a42/b0e140a5c4c643a88abbebf5d20c54b2/FLAGc83ece008 [2022-04-08 08:40:25,808 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:40:25,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.07.i.cil-1.c [2022-04-08 08:40:25,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5ad9a42/b0e140a5c4c643a88abbebf5d20c54b2/FLAGc83ece008 [2022-04-08 08:40:25,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5ad9a42/b0e140a5c4c643a88abbebf5d20c54b2 [2022-04-08 08:40:25,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:40:25,843 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:40:25,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:40:25,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:40:25,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:40:25,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:40:25" (1/1) ... [2022-04-08 08:40:25,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ed9521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:40:25, skipping insertion in model container [2022-04-08 08:40:25,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:40:25" (1/1) ... [2022-04-08 08:40:25,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:40:25,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:40:26,183 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.07.i.cil-1.c[74369,74382] [2022-04-08 08:40:26,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:40:26,212 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:40:26,334 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.07.i.cil-1.c[74369,74382] [2022-04-08 08:40:26,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:40:26,356 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:40:26,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:40:26 WrapperNode [2022-04-08 08:40:26,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:40:26,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:40:26,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:40:26,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:40:26,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:40:26" (1/1) ... [2022-04-08 08:40:26,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:40:26" (1/1) ... [2022-04-08 08:40:26,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:40:26" (1/1) ... [2022-04-08 08:40:26,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:40:26" (1/1) ... [2022-04-08 08:40:26,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:40:26" (1/1) ... [2022-04-08 08:40:26,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:40:26" (1/1) ... [2022-04-08 08:40:26,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:40:26" (1/1) ... [2022-04-08 08:40:26,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:40:26,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:40:26,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:40:26,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:40:26,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:40:26" (1/1) ... [2022-04-08 08:40:26,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:40:26,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:40:26,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:40:26,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:40:26,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:40:26,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:40:26,531 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:40:26,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 08:40:26,531 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 08:40:26,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:40:26,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 08:40:26,531 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:40:26,531 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:40:26,531 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:40:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:40:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:40:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:40:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:40:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:40:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:40:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:40:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:40:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:40:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:40:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:40:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:40:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:40:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:40:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:40:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:40:26,692 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:40:26,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:40:27,399 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:40:27,848 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 08:40:27,848 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 08:40:27,862 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:40:27,867 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:40:27,868 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:40:27,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:40:27 BoogieIcfgContainer [2022-04-08 08:40:27,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:40:27,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:40:27,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:40:27,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:40:27,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:40:25" (1/3) ... [2022-04-08 08:40:27,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c648e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:40:27, skipping insertion in model container [2022-04-08 08:40:27,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:40:26" (2/3) ... [2022-04-08 08:40:27,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c648e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:40:27, skipping insertion in model container [2022-04-08 08:40:27,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:40:27" (3/3) ... [2022-04-08 08:40:27,879 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-1.c [2022-04-08 08:40:27,882 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:40:27,882 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:40:27,919 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:40:27,930 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:40:27,931 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:40:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 08:40:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 08:40:27,961 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:27,961 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:40:27,961 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:27,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:27,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 1 times [2022-04-08 08:40:27,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:27,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [572945599] [2022-04-08 08:40:27,981 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:40:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 2 times [2022-04-08 08:40:27,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:27,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874708161] [2022-04-08 08:40:27,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:27,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:28,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:28,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-08 08:40:28,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-08 08:40:28,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-08 08:40:28,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:40:28,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-08 08:40:28,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-08 08:40:28,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-08 08:40:28,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-08 08:40:28,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#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; {161#true} is VALID [2022-04-08 08:40:28,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {161#true} is VALID [2022-04-08 08:40:28,434 INFO L272 TraceCheckUtils]: 7: Hoare triple {161#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {161#true} is VALID [2022-04-08 08:40:28,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(not (= 8544 (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; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(not (= 8544 (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; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= 8544 (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)))); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#(not (= 8544 (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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#(not (= 8544 (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; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:28,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {167#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-08 08:40:28,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {167#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {162#false} is VALID [2022-04-08 08:40:28,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {162#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:40:28,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {162#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {162#false} is VALID [2022-04-08 08:40:28,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {162#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {162#false} is VALID [2022-04-08 08:40:28,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {162#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {162#false} is VALID [2022-04-08 08:40:28,456 INFO L290 TraceCheckUtils]: 38: Hoare triple {162#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {162#false} is VALID [2022-04-08 08:40:28,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {162#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {162#false} is VALID [2022-04-08 08:40:28,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 8 == ~blastFlag~0; {162#false} is VALID [2022-04-08 08:40:28,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-08 08:40:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:40:28,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:28,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874708161] [2022-04-08 08:40:28,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874708161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:28,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:28,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:28,463 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:28,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [572945599] [2022-04-08 08:40:28,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [572945599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:28,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:28,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:28,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397128] [2022-04-08 08:40:28,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:28,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 08:40:28,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:28,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:28,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:28,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:28,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:28,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:28,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:28,537 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 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 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:31,907 INFO L93 Difference]: Finished difference Result 428 states and 723 transitions. [2022-04-08 08:40:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:31,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 08:40:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-04-08 08:40:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-04-08 08:40:31,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 723 transitions. [2022-04-08 08:40:32,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 723 edges. 723 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:32,443 INFO L225 Difference]: With dead ends: 428 [2022-04-08 08:40:32,444 INFO L226 Difference]: Without dead ends: 259 [2022-04-08 08:40:32,447 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:40:32,452 INFO L913 BasicCegarLoop]: 157 mSDtfsCounter, 163 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:32,453 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 461 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 08:40:32,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-08 08:40:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 170. [2022-04-08 08:40:32,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:32,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:32,483 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:32,484 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:32,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:32,500 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2022-04-08 08:40:32,500 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2022-04-08 08:40:32,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:32,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:32,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-08 08:40:32,503 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-08 08:40:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:32,511 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2022-04-08 08:40:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2022-04-08 08:40:32,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:32,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:32,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:32,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-08 08:40:32,518 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-08 08:40:32,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:32,518 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-08 08:40:32,519 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:32,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 265 transitions. [2022-04-08 08:40:32,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-08 08:40:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 08:40:32,701 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:32,701 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:40:32,702 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:40:32,702 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:32,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:32,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 1 times [2022-04-08 08:40:32,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:32,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [857229307] [2022-04-08 08:40:32,703 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:40:32,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 2 times [2022-04-08 08:40:32,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:32,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889995618] [2022-04-08 08:40:32,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:32,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:32,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:32,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {1894#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1887#true} is VALID [2022-04-08 08:40:32,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {1887#true} assume true; {1887#true} is VALID [2022-04-08 08:40:32,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1887#true} {1887#true} #689#return; {1887#true} is VALID [2022-04-08 08:40:32,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {1887#true} call ULTIMATE.init(); {1894#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:40:32,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {1894#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1887#true} is VALID [2022-04-08 08:40:32,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {1887#true} assume true; {1887#true} is VALID [2022-04-08 08:40:32,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1887#true} {1887#true} #689#return; {1887#true} is VALID [2022-04-08 08:40:32,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {1887#true} call #t~ret161 := main(); {1887#true} is VALID [2022-04-08 08:40:32,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {1887#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; {1887#true} is VALID [2022-04-08 08:40:32,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {1887#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1887#true} is VALID [2022-04-08 08:40:32,866 INFO L272 TraceCheckUtils]: 7: Hoare triple {1887#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1887#true} is VALID [2022-04-08 08:40:32,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {1887#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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {1892#(not (= 8545 (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; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {1892#(not (= 8545 (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; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {1892#(not (= 8545 (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)))); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {1892#(not (= 8545 (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; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {1892#(not (= 8545 (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); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:32,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {1892#(not (= 8545 (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); {1893#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-08 08:40:32,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {1893#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {1888#false} is VALID [2022-04-08 08:40:32,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {1888#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {1888#false} is VALID [2022-04-08 08:40:32,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {1888#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {1888#false} is VALID [2022-04-08 08:40:32,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {1888#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {1888#false} is VALID [2022-04-08 08:40:32,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {1888#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {1888#false} is VALID [2022-04-08 08:40:32,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {1888#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {1888#false} is VALID [2022-04-08 08:40:32,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {1888#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {1888#false} is VALID [2022-04-08 08:40:32,879 INFO L290 TraceCheckUtils]: 41: Hoare triple {1888#false} assume 8 == ~blastFlag~0; {1888#false} is VALID [2022-04-08 08:40:32,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {1888#false} assume !false; {1888#false} is VALID [2022-04-08 08:40:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:40:32,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:32,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889995618] [2022-04-08 08:40:32,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889995618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:32,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:32,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:32,883 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:32,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [857229307] [2022-04-08 08:40:32,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [857229307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:32,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:32,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465971158] [2022-04-08 08:40:32,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:32,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 08:40:32,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:32,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:32,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:32,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:32,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:32,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:32,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:32,927 INFO L87 Difference]: Start difference. First operand 170 states and 265 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:36,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:39,404 INFO L93 Difference]: Finished difference Result 442 states and 693 transitions. [2022-04-08 08:40:39,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 08:40:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-08 08:40:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-08 08:40:39,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-08 08:40:39,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:39,805 INFO L225 Difference]: With dead ends: 442 [2022-04-08 08:40:39,805 INFO L226 Difference]: Without dead ends: 287 [2022-04-08 08:40:39,806 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:40:39,806 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 130 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:39,807 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 08:40:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-08 08:40:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 199. [2022-04-08 08:40:39,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:39,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:39,817 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:39,818 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:39,824 INFO L93 Difference]: Finished difference Result 287 states and 446 transitions. [2022-04-08 08:40:39,824 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 446 transitions. [2022-04-08 08:40:39,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:39,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:39,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 287 states. [2022-04-08 08:40:39,826 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 287 states. [2022-04-08 08:40:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:39,832 INFO L93 Difference]: Finished difference Result 287 states and 446 transitions. [2022-04-08 08:40:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 446 transitions. [2022-04-08 08:40:39,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:39,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:39,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:39,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-08 08:40:39,837 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-08 08:40:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:39,838 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-08 08:40:39,838 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:39,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 317 transitions. [2022-04-08 08:40:40,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-08 08:40:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 08:40:40,054 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:40,054 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:40:40,054 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:40:40,054 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 1 times [2022-04-08 08:40:40,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:40,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [750447030] [2022-04-08 08:40:40,056 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:40:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 2 times [2022-04-08 08:40:40,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:40,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112219150] [2022-04-08 08:40:40,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:40,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:40,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {3762#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3755#true} is VALID [2022-04-08 08:40:40,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {3755#true} assume true; {3755#true} is VALID [2022-04-08 08:40:40,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3755#true} {3755#true} #689#return; {3755#true} is VALID [2022-04-08 08:40:40,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {3755#true} call ULTIMATE.init(); {3762#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:40:40,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {3762#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3755#true} is VALID [2022-04-08 08:40:40,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {3755#true} assume true; {3755#true} is VALID [2022-04-08 08:40:40,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3755#true} {3755#true} #689#return; {3755#true} is VALID [2022-04-08 08:40:40,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {3755#true} call #t~ret161 := main(); {3755#true} is VALID [2022-04-08 08:40:40,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {3755#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; {3755#true} is VALID [2022-04-08 08:40:40,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {3755#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3755#true} is VALID [2022-04-08 08:40:40,182 INFO L272 TraceCheckUtils]: 7: Hoare triple {3755#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3755#true} is VALID [2022-04-08 08:40:40,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {3755#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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {3760#(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; {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {3760#(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; {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {3760#(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)))); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {3760#(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; {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,210 INFO L290 TraceCheckUtils]: 42: Hoare triple {3760#(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); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:40,211 INFO L290 TraceCheckUtils]: 43: Hoare triple {3760#(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); {3761#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-08 08:40:40,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {3761#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {3756#false} is VALID [2022-04-08 08:40:40,211 INFO L290 TraceCheckUtils]: 45: Hoare triple {3756#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3756#false} is VALID [2022-04-08 08:40:40,211 INFO L290 TraceCheckUtils]: 46: Hoare triple {3756#false} assume 5 == ~blastFlag~0; {3756#false} is VALID [2022-04-08 08:40:40,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {3756#false} assume !false; {3756#false} is VALID [2022-04-08 08:40:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:40:40,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:40,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112219150] [2022-04-08 08:40:40,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112219150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:40,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:40,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:40,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:40,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [750447030] [2022-04-08 08:40:40,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [750447030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:40,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:40,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:40,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427158880] [2022-04-08 08:40:40,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:40,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 08:40:40,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:40,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:40,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:40,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:40,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:40,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:40,248 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:42,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:43,431 INFO L93 Difference]: Finished difference Result 501 states and 796 transitions. [2022-04-08 08:40:43,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:43,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 08:40:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-08 08:40:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-08 08:40:43,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-08 08:40:43,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:43,828 INFO L225 Difference]: With dead ends: 501 [2022-04-08 08:40:43,828 INFO L226 Difference]: Without dead ends: 317 [2022-04-08 08:40:43,829 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:40:43,830 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 119 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:43,830 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 342 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 08:40:43,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-04-08 08:40:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 239. [2022-04-08 08:40:43,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:43,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 317 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:43,843 INFO L74 IsIncluded]: Start isIncluded. First operand 317 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:43,843 INFO L87 Difference]: Start difference. First operand 317 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:43,849 INFO L93 Difference]: Finished difference Result 317 states and 497 transitions. [2022-04-08 08:40:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 497 transitions. [2022-04-08 08:40:43,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:43,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:43,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 317 states. [2022-04-08 08:40:43,850 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 317 states. [2022-04-08 08:40:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:43,856 INFO L93 Difference]: Finished difference Result 317 states and 497 transitions. [2022-04-08 08:40:43,856 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 497 transitions. [2022-04-08 08:40:43,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:43,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:43,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:43,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-08 08:40:43,861 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 48 [2022-04-08 08:40:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:43,861 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-08 08:40:43,862 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:43,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 388 transitions. [2022-04-08 08:40:44,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-08 08:40:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 08:40:44,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:44,110 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:40:44,110 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:40:44,110 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:44,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:44,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 1 times [2022-04-08 08:40:44,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:44,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1183997867] [2022-04-08 08:40:44,111 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:40:44,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 2 times [2022-04-08 08:40:44,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:44,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646230499] [2022-04-08 08:40:44,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:44,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:44,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:44,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {5888#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5881#true} is VALID [2022-04-08 08:40:44,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {5881#true} assume true; {5881#true} is VALID [2022-04-08 08:40:44,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5881#true} {5881#true} #689#return; {5881#true} is VALID [2022-04-08 08:40:44,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {5881#true} call ULTIMATE.init(); {5888#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:40:44,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {5888#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5881#true} is VALID [2022-04-08 08:40:44,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {5881#true} assume true; {5881#true} is VALID [2022-04-08 08:40:44,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5881#true} {5881#true} #689#return; {5881#true} is VALID [2022-04-08 08:40:44,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {5881#true} call #t~ret161 := main(); {5881#true} is VALID [2022-04-08 08:40:44,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {5881#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; {5881#true} is VALID [2022-04-08 08:40:44,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {5881#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5881#true} is VALID [2022-04-08 08:40:44,262 INFO L272 TraceCheckUtils]: 7: Hoare triple {5881#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5881#true} is VALID [2022-04-08 08:40:44,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {5881#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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {5886#(not (= 8641 (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; {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {5886#(not (= 8641 (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; {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {5886#(not (= 8641 (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)))); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {5886#(not (= 8641 (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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {5886#(not (= 8641 (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; {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,276 INFO L290 TraceCheckUtils]: 42: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,277 INFO L290 TraceCheckUtils]: 43: Hoare triple {5886#(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); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:44,277 INFO L290 TraceCheckUtils]: 44: Hoare triple {5886#(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); {5887#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-08 08:40:44,277 INFO L290 TraceCheckUtils]: 45: Hoare triple {5887#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {5882#false} is VALID [2022-04-08 08:40:44,278 INFO L290 TraceCheckUtils]: 46: Hoare triple {5882#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5882#false} is VALID [2022-04-08 08:40:44,278 INFO L290 TraceCheckUtils]: 47: Hoare triple {5882#false} assume 5 == ~blastFlag~0; {5882#false} is VALID [2022-04-08 08:40:44,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {5882#false} assume !false; {5882#false} is VALID [2022-04-08 08:40:44,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:40:44,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:44,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646230499] [2022-04-08 08:40:44,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646230499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:44,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:44,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:44,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:44,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1183997867] [2022-04-08 08:40:44,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1183997867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:44,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:44,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:44,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891392745] [2022-04-08 08:40:44,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:44,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 08:40:44,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:44,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:44,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:44,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:44,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:44,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:44,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:44,319 INFO L87 Difference]: Start difference. First operand 239 states and 388 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:45,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:47,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:50,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:52,404 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:53,547 INFO L93 Difference]: Finished difference Result 551 states and 886 transitions. [2022-04-08 08:40:53,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:53,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 08:40:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-08 08:40:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-08 08:40:53,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 592 transitions. [2022-04-08 08:40:53,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 592 edges. 592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:53,967 INFO L225 Difference]: With dead ends: 551 [2022-04-08 08:40:53,968 INFO L226 Difference]: Without dead ends: 327 [2022-04-08 08:40:53,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:40:53,969 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 118 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:53,969 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 356 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 483 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-04-08 08:40:53,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-04-08 08:40:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 250. [2022-04-08 08:40:53,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:53,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 327 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:53,981 INFO L74 IsIncluded]: Start isIncluded. First operand 327 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:53,981 INFO L87 Difference]: Start difference. First operand 327 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:53,987 INFO L93 Difference]: Finished difference Result 327 states and 516 transitions. [2022-04-08 08:40:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 516 transitions. [2022-04-08 08:40:53,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:53,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:53,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 327 states. [2022-04-08 08:40:53,996 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 327 states. [2022-04-08 08:40:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:54,002 INFO L93 Difference]: Finished difference Result 327 states and 516 transitions. [2022-04-08 08:40:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 516 transitions. [2022-04-08 08:40:54,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:54,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:54,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:54,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 409 transitions. [2022-04-08 08:40:54,007 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 409 transitions. Word has length 49 [2022-04-08 08:40:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:54,007 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 409 transitions. [2022-04-08 08:40:54,007 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:54,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 409 transitions. [2022-04-08 08:40:54,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 409 transitions. [2022-04-08 08:40:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-08 08:40:54,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:54,319 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:40:54,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:40:54,319 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:54,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:54,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1073389890, now seen corresponding path program 1 times [2022-04-08 08:40:54,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:54,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [241251970] [2022-04-08 08:40:54,364 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:40:54,364 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:40:54,365 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:40:54,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1073389890, now seen corresponding path program 2 times [2022-04-08 08:40:54,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:54,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324981732] [2022-04-08 08:40:54,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:54,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:54,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:54,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {8156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8149#true} is VALID [2022-04-08 08:40:54,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {8149#true} assume true; {8149#true} is VALID [2022-04-08 08:40:54,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8149#true} {8149#true} #689#return; {8149#true} is VALID [2022-04-08 08:40:54,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {8149#true} call ULTIMATE.init(); {8156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:40:54,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {8156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8149#true} is VALID [2022-04-08 08:40:54,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {8149#true} assume true; {8149#true} is VALID [2022-04-08 08:40:54,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8149#true} {8149#true} #689#return; {8149#true} is VALID [2022-04-08 08:40:54,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {8149#true} call #t~ret161 := main(); {8149#true} is VALID [2022-04-08 08:40:54,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {8149#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; {8149#true} is VALID [2022-04-08 08:40:54,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {8149#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8149#true} is VALID [2022-04-08 08:40:54,542 INFO L272 TraceCheckUtils]: 7: Hoare triple {8149#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8149#true} is VALID [2022-04-08 08:40:54,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {8149#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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {8154#(not (= 8528 (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; {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {8154#(not (= 8528 (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; {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {8154#(not (= 8528 (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)))); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {8154#(not (= 8528 (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; {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {8154#(not (= 8528 (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); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:54,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {8154#(not (= 8528 (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); {8155#(not (= |ssl3_accept_#t~mem62| 8528))} is VALID [2022-04-08 08:40:54,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {8155#(not (= |ssl3_accept_#t~mem62| 8528))} assume 8528 == #t~mem62;havoc #t~mem62; {8150#false} is VALID [2022-04-08 08:40:54,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {8150#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {8150#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {8150#false} is VALID [2022-04-08 08:40:54,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {8150#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {8150#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {8150#false} is VALID [2022-04-08 08:40:54,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {8150#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {8150#false} is VALID [2022-04-08 08:40:54,556 INFO L290 TraceCheckUtils]: 37: Hoare triple {8150#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {8150#false} is VALID [2022-04-08 08:40:54,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {8150#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {8150#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); {8150#false} is VALID [2022-04-08 08:40:54,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {8150#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8150#false} is VALID [2022-04-08 08:40:54,556 INFO L290 TraceCheckUtils]: 41: Hoare triple {8150#false} ~skip~0 := 0; {8150#false} is VALID [2022-04-08 08:40:54,556 INFO L290 TraceCheckUtils]: 42: Hoare triple {8150#false} assume !false; {8150#false} is VALID [2022-04-08 08:40:54,556 INFO L290 TraceCheckUtils]: 43: Hoare triple {8150#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); {8150#false} is VALID [2022-04-08 08:40:54,556 INFO L290 TraceCheckUtils]: 44: Hoare triple {8150#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,556 INFO L290 TraceCheckUtils]: 45: Hoare triple {8150#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,556 INFO L290 TraceCheckUtils]: 46: Hoare triple {8150#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,556 INFO L290 TraceCheckUtils]: 47: Hoare triple {8150#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {8150#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {8150#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,557 INFO L290 TraceCheckUtils]: 50: Hoare triple {8150#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,557 INFO L290 TraceCheckUtils]: 51: Hoare triple {8150#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,557 INFO L290 TraceCheckUtils]: 52: Hoare triple {8150#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,557 INFO L290 TraceCheckUtils]: 53: Hoare triple {8150#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,557 INFO L290 TraceCheckUtils]: 54: Hoare triple {8150#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,557 INFO L290 TraceCheckUtils]: 55: Hoare triple {8150#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {8150#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {8150#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {8150#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,557 INFO L290 TraceCheckUtils]: 59: Hoare triple {8150#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,557 INFO L290 TraceCheckUtils]: 60: Hoare triple {8150#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,557 INFO L290 TraceCheckUtils]: 61: Hoare triple {8150#false} assume 8544 == #t~mem64;havoc #t~mem64; {8150#false} is VALID [2022-04-08 08:40:54,558 INFO L290 TraceCheckUtils]: 62: Hoare triple {8150#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,558 INFO L290 TraceCheckUtils]: 63: Hoare triple {8150#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,558 INFO L290 TraceCheckUtils]: 64: Hoare triple {8150#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {8150#false} is VALID [2022-04-08 08:40:54,558 INFO L290 TraceCheckUtils]: 65: Hoare triple {8150#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {8150#false} is VALID [2022-04-08 08:40:54,558 INFO L290 TraceCheckUtils]: 66: Hoare triple {8150#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {8150#false} is VALID [2022-04-08 08:40:54,558 INFO L290 TraceCheckUtils]: 67: Hoare triple {8150#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {8150#false} is VALID [2022-04-08 08:40:54,558 INFO L290 TraceCheckUtils]: 68: Hoare triple {8150#false} assume 8 == ~blastFlag~0; {8150#false} is VALID [2022-04-08 08:40:54,558 INFO L290 TraceCheckUtils]: 69: Hoare triple {8150#false} assume !false; {8150#false} is VALID [2022-04-08 08:40:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:40:54,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:54,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324981732] [2022-04-08 08:40:54,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324981732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:54,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:54,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:54,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:54,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [241251970] [2022-04-08 08:40:54,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [241251970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:54,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:54,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682398966] [2022-04-08 08:40:54,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:54,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-08 08:40:54,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:54,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:54,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:54,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:54,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:54,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:54,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:54,607 INFO L87 Difference]: Start difference. First operand 250 states and 409 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:02,359 INFO L93 Difference]: Finished difference Result 602 states and 977 transitions. [2022-04-08 08:41:02,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:02,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-08 08:41:02,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 08:41:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 08:41:02,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-08 08:41:02,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:02,773 INFO L225 Difference]: With dead ends: 602 [2022-04-08 08:41:02,773 INFO L226 Difference]: Without dead ends: 367 [2022-04-08 08:41:02,773 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:41:02,774 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 131 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:02,774 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 356 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-08 08:41:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-04-08 08:41:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 276. [2022-04-08 08:41:02,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:02,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 367 states. Second operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:02,799 INFO L74 IsIncluded]: Start isIncluded. First operand 367 states. Second operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:02,800 INFO L87 Difference]: Start difference. First operand 367 states. Second operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:02,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:02,806 INFO L93 Difference]: Finished difference Result 367 states and 584 transitions. [2022-04-08 08:41:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 584 transitions. [2022-04-08 08:41:02,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:02,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:02,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 367 states. [2022-04-08 08:41:02,807 INFO L87 Difference]: Start difference. First operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 367 states. [2022-04-08 08:41:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:02,817 INFO L93 Difference]: Finished difference Result 367 states and 584 transitions. [2022-04-08 08:41:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 584 transitions. [2022-04-08 08:41:02,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:02,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:02,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:02,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:02,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 453 transitions. [2022-04-08 08:41:02,823 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 453 transitions. Word has length 70 [2022-04-08 08:41:02,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:02,823 INFO L478 AbstractCegarLoop]: Abstraction has 276 states and 453 transitions. [2022-04-08 08:41:02,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:02,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 276 states and 453 transitions. [2022-04-08 08:41:03,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 453 transitions. [2022-04-08 08:41:03,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 08:41:03,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:03,152 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-08 08:41:03,152 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:41:03,152 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:03,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:03,152 INFO L85 PathProgramCache]: Analyzing trace with hash -339232893, now seen corresponding path program 1 times [2022-04-08 08:41:03,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:03,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [864559966] [2022-04-08 08:41:03,185 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:03,185 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:03,185 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash -339232893, now seen corresponding path program 2 times [2022-04-08 08:41:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:03,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328898671] [2022-04-08 08:41:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:03,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:03,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {10658#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10651#true} is VALID [2022-04-08 08:41:03,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {10651#true} assume true; {10651#true} is VALID [2022-04-08 08:41:03,294 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10651#true} {10651#true} #689#return; {10651#true} is VALID [2022-04-08 08:41:03,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {10651#true} call ULTIMATE.init(); {10658#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:03,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {10658#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10651#true} is VALID [2022-04-08 08:41:03,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {10651#true} assume true; {10651#true} is VALID [2022-04-08 08:41:03,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10651#true} {10651#true} #689#return; {10651#true} is VALID [2022-04-08 08:41:03,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {10651#true} call #t~ret161 := main(); {10651#true} is VALID [2022-04-08 08:41:03,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {10651#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; {10651#true} is VALID [2022-04-08 08:41:03,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {10651#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {10651#true} is VALID [2022-04-08 08:41:03,295 INFO L272 TraceCheckUtils]: 7: Hoare triple {10651#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10651#true} is VALID [2022-04-08 08:41:03,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {10651#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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {10656#(not (= 8529 (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; {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {10656#(not (= 8529 (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; {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {10656#(not (= 8529 (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)))); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {10656#(not (= 8529 (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; {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {10656#(not (= 8529 (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); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:03,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {10656#(not (= 8529 (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); {10657#(not (= |ssl3_accept_#t~mem63| 8529))} is VALID [2022-04-08 08:41:03,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {10657#(not (= |ssl3_accept_#t~mem63| 8529))} assume 8529 == #t~mem63;havoc #t~mem63; {10652#false} is VALID [2022-04-08 08:41:03,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {10652#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {10652#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {10652#false} is VALID [2022-04-08 08:41:03,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {10652#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {10652#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {10652#false} is VALID [2022-04-08 08:41:03,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {10652#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {10652#false} is VALID [2022-04-08 08:41:03,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {10652#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {10652#false} is VALID [2022-04-08 08:41:03,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {10652#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,307 INFO L290 TraceCheckUtils]: 40: Hoare triple {10652#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); {10652#false} is VALID [2022-04-08 08:41:03,307 INFO L290 TraceCheckUtils]: 41: Hoare triple {10652#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {10652#false} is VALID [2022-04-08 08:41:03,307 INFO L290 TraceCheckUtils]: 42: Hoare triple {10652#false} ~skip~0 := 0; {10652#false} is VALID [2022-04-08 08:41:03,307 INFO L290 TraceCheckUtils]: 43: Hoare triple {10652#false} assume !false; {10652#false} is VALID [2022-04-08 08:41:03,307 INFO L290 TraceCheckUtils]: 44: Hoare triple {10652#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); {10652#false} is VALID [2022-04-08 08:41:03,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {10652#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,307 INFO L290 TraceCheckUtils]: 46: Hoare triple {10652#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,307 INFO L290 TraceCheckUtils]: 47: Hoare triple {10652#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,307 INFO L290 TraceCheckUtils]: 48: Hoare triple {10652#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {10652#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {10652#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {10652#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 52: Hoare triple {10652#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 53: Hoare triple {10652#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 54: Hoare triple {10652#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 55: Hoare triple {10652#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 56: Hoare triple {10652#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 57: Hoare triple {10652#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 58: Hoare triple {10652#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 59: Hoare triple {10652#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 60: Hoare triple {10652#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 61: Hoare triple {10652#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 62: Hoare triple {10652#false} assume 8544 == #t~mem64;havoc #t~mem64; {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 63: Hoare triple {10652#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 64: Hoare triple {10652#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,308 INFO L290 TraceCheckUtils]: 65: Hoare triple {10652#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {10652#false} is VALID [2022-04-08 08:41:03,309 INFO L290 TraceCheckUtils]: 66: Hoare triple {10652#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {10652#false} is VALID [2022-04-08 08:41:03,313 INFO L290 TraceCheckUtils]: 67: Hoare triple {10652#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {10652#false} is VALID [2022-04-08 08:41:03,313 INFO L290 TraceCheckUtils]: 68: Hoare triple {10652#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {10652#false} is VALID [2022-04-08 08:41:03,313 INFO L290 TraceCheckUtils]: 69: Hoare triple {10652#false} assume 8 == ~blastFlag~0; {10652#false} is VALID [2022-04-08 08:41:03,313 INFO L290 TraceCheckUtils]: 70: Hoare triple {10652#false} assume !false; {10652#false} is VALID [2022-04-08 08:41:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:41:03,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:03,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328898671] [2022-04-08 08:41:03,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328898671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:03,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:03,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:03,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:03,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [864559966] [2022-04-08 08:41:03,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [864559966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:03,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:03,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:03,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007156583] [2022-04-08 08:41:03,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:03,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-08 08:41:03,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:03,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:03,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:03,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:03,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:03,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:03,367 INFO L87 Difference]: Start difference. First operand 276 states and 453 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:07,866 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:09,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:10,642 INFO L93 Difference]: Finished difference Result 614 states and 994 transitions. [2022-04-08 08:41:10,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:10,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-08 08:41:10,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 08:41:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 08:41:10,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-08 08:41:11,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:11,040 INFO L225 Difference]: With dead ends: 614 [2022-04-08 08:41:11,040 INFO L226 Difference]: Without dead ends: 353 [2022-04-08 08:41:11,041 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:41:11,041 INFO L913 BasicCegarLoop]: 142 mSDtfsCounter, 130 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:11,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 392 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-08 08:41:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-08 08:41:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 276. [2022-04-08 08:41:11,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:11,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:11,054 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:11,054 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:11,060 INFO L93 Difference]: Finished difference Result 353 states and 557 transitions. [2022-04-08 08:41:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 557 transitions. [2022-04-08 08:41:11,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:11,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:11,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 353 states. [2022-04-08 08:41:11,061 INFO L87 Difference]: Start difference. First operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 353 states. [2022-04-08 08:41:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:11,066 INFO L93 Difference]: Finished difference Result 353 states and 557 transitions. [2022-04-08 08:41:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 557 transitions. [2022-04-08 08:41:11,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:11,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:11,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:11,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 450 transitions. [2022-04-08 08:41:11,078 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 450 transitions. Word has length 71 [2022-04-08 08:41:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:11,078 INFO L478 AbstractCegarLoop]: Abstraction has 276 states and 450 transitions. [2022-04-08 08:41:11,078 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:11,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 276 states and 450 transitions. [2022-04-08 08:41:11,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 450 transitions. [2022-04-08 08:41:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 08:41:11,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:11,404 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:11,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:41:11,404 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:11,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:11,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1306774635, now seen corresponding path program 1 times [2022-04-08 08:41:11,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:11,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [456695372] [2022-04-08 08:41:11,431 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:11,432 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:11,432 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1306774635, now seen corresponding path program 2 times [2022-04-08 08:41:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:11,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145962858] [2022-04-08 08:41:11,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:11,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:11,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:11,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {13156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13149#true} is VALID [2022-04-08 08:41:11,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {13149#true} assume true; {13149#true} is VALID [2022-04-08 08:41:11,564 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13149#true} {13149#true} #689#return; {13149#true} is VALID [2022-04-08 08:41:11,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {13149#true} call ULTIMATE.init(); {13156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:11,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {13156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13149#true} is VALID [2022-04-08 08:41:11,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {13149#true} assume true; {13149#true} is VALID [2022-04-08 08:41:11,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13149#true} {13149#true} #689#return; {13149#true} is VALID [2022-04-08 08:41:11,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {13149#true} call #t~ret161 := main(); {13149#true} is VALID [2022-04-08 08:41:11,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {13149#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; {13149#true} is VALID [2022-04-08 08:41:11,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {13149#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {13149#true} is VALID [2022-04-08 08:41:11,565 INFO L272 TraceCheckUtils]: 7: Hoare triple {13149#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13149#true} is VALID [2022-04-08 08:41:11,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {13149#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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {13154#(not (= 8448 (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; {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {13154#(not (= 8448 (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; {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {13154#(not (= 8448 (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)))); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {13154#(not (= 8448 (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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {13154#(not (= 8448 (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; {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {13154#(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); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:11,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {13154#(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); {13155#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-08 08:41:11,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {13155#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {13150#false} is VALID [2022-04-08 08:41:11,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {13150#false} assume !(~num1~0 > 0); {13150#false} is VALID [2022-04-08 08:41:11,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {13150#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; {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {13150#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); {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {13150#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {13150#false} ~skip~0 := 0; {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 43: Hoare triple {13150#false} assume !false; {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 44: Hoare triple {13150#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); {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {13150#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 46: Hoare triple {13150#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 47: Hoare triple {13150#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 48: Hoare triple {13150#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 49: Hoare triple {13150#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 50: Hoare triple {13150#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 51: Hoare triple {13150#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 52: Hoare triple {13150#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 53: Hoare triple {13150#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,585 INFO L290 TraceCheckUtils]: 54: Hoare triple {13150#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 55: Hoare triple {13150#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 56: Hoare triple {13150#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 57: Hoare triple {13150#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 58: Hoare triple {13150#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 59: Hoare triple {13150#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {13150#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {13150#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 62: Hoare triple {13150#false} assume 8544 == #t~mem64;havoc #t~mem64; {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 63: Hoare triple {13150#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 64: Hoare triple {13150#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 65: Hoare triple {13150#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 66: Hoare triple {13150#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 67: Hoare triple {13150#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 68: Hoare triple {13150#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 69: Hoare triple {13150#false} assume 8 == ~blastFlag~0; {13150#false} is VALID [2022-04-08 08:41:11,586 INFO L290 TraceCheckUtils]: 70: Hoare triple {13150#false} assume !false; {13150#false} is VALID [2022-04-08 08:41:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:41:11,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:11,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145962858] [2022-04-08 08:41:11,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145962858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:11,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:11,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:11,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:11,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [456695372] [2022-04-08 08:41:11,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [456695372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:11,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:11,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:11,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141185290] [2022-04-08 08:41:11,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:11,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-08 08:41:11,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:11,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:11,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:11,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:11,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:11,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:11,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:11,658 INFO L87 Difference]: Start difference. First operand 276 states and 450 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:17,972 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:19,083 INFO L93 Difference]: Finished difference Result 690 states and 1122 transitions. [2022-04-08 08:41:19,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:19,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-08 08:41:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-08 08:41:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-08 08:41:19,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-08 08:41:19,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:19,491 INFO L225 Difference]: With dead ends: 690 [2022-04-08 08:41:19,491 INFO L226 Difference]: Without dead ends: 429 [2022-04-08 08:41:19,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:41:19,492 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 123 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:19,492 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 414 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 08:41:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-04-08 08:41:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 340. [2022-04-08 08:41:19,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:19,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:19,505 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:19,505 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:19,513 INFO L93 Difference]: Finished difference Result 429 states and 689 transitions. [2022-04-08 08:41:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 689 transitions. [2022-04-08 08:41:19,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:19,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:19,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 429 states. [2022-04-08 08:41:19,514 INFO L87 Difference]: Start difference. First operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 429 states. [2022-04-08 08:41:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:19,522 INFO L93 Difference]: Finished difference Result 429 states and 689 transitions. [2022-04-08 08:41:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 689 transitions. [2022-04-08 08:41:19,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:19,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:19,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:19,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:19,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 558 transitions. [2022-04-08 08:41:19,528 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 558 transitions. Word has length 71 [2022-04-08 08:41:19,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:19,529 INFO L478 AbstractCegarLoop]: Abstraction has 340 states and 558 transitions. [2022-04-08 08:41:19,529 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:19,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 340 states and 558 transitions. [2022-04-08 08:41:19,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 558 transitions. [2022-04-08 08:41:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 08:41:19,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:19,916 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-04-08 08:41:19,916 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:41:19,916 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:19,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash -351909833, now seen corresponding path program 1 times [2022-04-08 08:41:19,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:19,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2055425209] [2022-04-08 08:41:19,959 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:19,959 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:19,959 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:19,959 INFO L85 PathProgramCache]: Analyzing trace with hash -351909833, now seen corresponding path program 2 times [2022-04-08 08:41:19,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:19,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041047069] [2022-04-08 08:41:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:19,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:20,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:20,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {16086#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16079#true} is VALID [2022-04-08 08:41:20,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {16079#true} assume true; {16079#true} is VALID [2022-04-08 08:41:20,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16079#true} {16079#true} #689#return; {16079#true} is VALID [2022-04-08 08:41:20,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {16079#true} call ULTIMATE.init(); {16086#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:20,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {16086#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16079#true} is VALID [2022-04-08 08:41:20,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {16079#true} assume true; {16079#true} is VALID [2022-04-08 08:41:20,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16079#true} {16079#true} #689#return; {16079#true} is VALID [2022-04-08 08:41:20,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {16079#true} call #t~ret161 := main(); {16079#true} is VALID [2022-04-08 08:41:20,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {16079#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; {16079#true} is VALID [2022-04-08 08:41:20,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {16079#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16079#true} is VALID [2022-04-08 08:41:20,126 INFO L272 TraceCheckUtils]: 7: Hoare triple {16079#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16079#true} is VALID [2022-04-08 08:41:20,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {16079#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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {16084#(not (= 8608 (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; {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {16084#(not (= 8608 (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; {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {16084#(not (= 8608 (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)))); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {16084#(not (= 8608 (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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {16084#(not (= 8608 (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; {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,134 INFO L290 TraceCheckUtils]: 27: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {16084#(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); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:20,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {16084#(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); {16085#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 42: Hoare triple {16085#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 43: Hoare triple {16080#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 44: Hoare triple {16080#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); {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 45: Hoare triple {16080#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); {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 46: Hoare triple {16080#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {16080#false} ~skip~0 := 0; {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {16080#false} assume !false; {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {16080#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); {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {16080#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 51: Hoare triple {16080#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 52: Hoare triple {16080#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {16080#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 54: Hoare triple {16080#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 55: Hoare triple {16080#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 56: Hoare triple {16080#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,139 INFO L290 TraceCheckUtils]: 57: Hoare triple {16080#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 58: Hoare triple {16080#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 59: Hoare triple {16080#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 60: Hoare triple {16080#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {16080#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {16080#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 63: Hoare triple {16080#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 64: Hoare triple {16080#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 65: Hoare triple {16080#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 66: Hoare triple {16080#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 67: Hoare triple {16080#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 68: Hoare triple {16080#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 69: Hoare triple {16080#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 70: Hoare triple {16080#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 71: Hoare triple {16080#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 72: Hoare triple {16080#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {16080#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,140 INFO L290 TraceCheckUtils]: 74: Hoare triple {16080#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,141 INFO L290 TraceCheckUtils]: 75: Hoare triple {16080#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,141 INFO L290 TraceCheckUtils]: 76: Hoare triple {16080#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,141 INFO L290 TraceCheckUtils]: 77: Hoare triple {16080#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-08 08:41:20,141 INFO L290 TraceCheckUtils]: 78: Hoare triple {16080#false} assume 8640 == #t~mem75;havoc #t~mem75; {16080#false} is VALID [2022-04-08 08:41:20,141 INFO L290 TraceCheckUtils]: 79: Hoare triple {16080#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16080#false} is VALID [2022-04-08 08:41:20,141 INFO L290 TraceCheckUtils]: 80: Hoare triple {16080#false} assume 5 == ~blastFlag~0; {16080#false} is VALID [2022-04-08 08:41:20,141 INFO L290 TraceCheckUtils]: 81: Hoare triple {16080#false} assume !false; {16080#false} is VALID [2022-04-08 08:41:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:41:20,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:20,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041047069] [2022-04-08 08:41:20,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041047069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:20,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:20,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:20,142 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:20,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2055425209] [2022-04-08 08:41:20,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2055425209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:20,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:20,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:20,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902566218] [2022-04-08 08:41:20,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:20,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-08 08:41:20,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:20,143 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-08 08:41:20,197 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-08 08:41:20,197 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:20,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:20,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:20,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:20,199 INFO L87 Difference]: Start difference. First operand 340 states and 558 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-08 08:41:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:25,363 INFO L93 Difference]: Finished difference Result 782 states and 1272 transitions. [2022-04-08 08:41:25,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:25,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-08 08:41:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:25,364 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-08 08:41:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 08:41:25,366 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-08 08:41:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 08:41:25,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-08 08:41:25,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:25,732 INFO L225 Difference]: With dead ends: 782 [2022-04-08 08:41:25,732 INFO L226 Difference]: Without dead ends: 457 [2022-04-08 08:41:25,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:41:25,733 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 119 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:25,733 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 376 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 08:41:25,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-04-08 08:41:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 377. [2022-04-08 08:41:25,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:25,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 457 states. Second operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:25,747 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:25,747 INFO L87 Difference]: Start difference. First operand 457 states. Second operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:25,755 INFO L93 Difference]: Finished difference Result 457 states and 731 transitions. [2022-04-08 08:41:25,755 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 731 transitions. [2022-04-08 08:41:25,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:25,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:25,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 457 states. [2022-04-08 08:41:25,757 INFO L87 Difference]: Start difference. First operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 457 states. [2022-04-08 08:41:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:25,765 INFO L93 Difference]: Finished difference Result 457 states and 731 transitions. [2022-04-08 08:41:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 731 transitions. [2022-04-08 08:41:25,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:25,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:25,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:25,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 620 transitions. [2022-04-08 08:41:25,779 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 620 transitions. Word has length 82 [2022-04-08 08:41:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:25,779 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 620 transitions. [2022-04-08 08:41:25,779 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:25,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 620 transitions. [2022-04-08 08:41:26,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 620 edges. 620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 620 transitions. [2022-04-08 08:41:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 08:41:26,232 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:26,232 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-04-08 08:41:26,232 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:41:26,232 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:26,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:26,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1069537033, now seen corresponding path program 1 times [2022-04-08 08:41:26,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:26,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1740713974] [2022-04-08 08:41:26,277 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:26,277 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:26,277 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:26,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1069537033, now seen corresponding path program 2 times [2022-04-08 08:41:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:26,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966470227] [2022-04-08 08:41:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:26,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:26,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:26,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {19330#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19323#true} is VALID [2022-04-08 08:41:26,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {19323#true} assume true; {19323#true} is VALID [2022-04-08 08:41:26,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19323#true} {19323#true} #689#return; {19323#true} is VALID [2022-04-08 08:41:26,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {19323#true} call ULTIMATE.init(); {19330#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:26,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {19330#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19323#true} is VALID [2022-04-08 08:41:26,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {19323#true} assume true; {19323#true} is VALID [2022-04-08 08:41:26,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19323#true} {19323#true} #689#return; {19323#true} is VALID [2022-04-08 08:41:26,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {19323#true} call #t~ret161 := main(); {19323#true} is VALID [2022-04-08 08:41:26,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {19323#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; {19323#true} is VALID [2022-04-08 08:41:26,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {19323#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {19323#true} is VALID [2022-04-08 08:41:26,399 INFO L272 TraceCheckUtils]: 7: Hoare triple {19323#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19323#true} is VALID [2022-04-08 08:41:26,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {19323#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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} 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; {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} 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; {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,411 INFO L290 TraceCheckUtils]: 39: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,411 INFO L290 TraceCheckUtils]: 40: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {19328#(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); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:41:26,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {19328#(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); {19329#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-08 08:41:26,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {19329#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {19324#false} is VALID [2022-04-08 08:41:26,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {19324#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {19324#false} is VALID [2022-04-08 08:41:26,412 INFO L290 TraceCheckUtils]: 45: Hoare triple {19324#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); {19324#false} is VALID [2022-04-08 08:41:26,412 INFO L290 TraceCheckUtils]: 46: Hoare triple {19324#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); {19324#false} is VALID [2022-04-08 08:41:26,412 INFO L290 TraceCheckUtils]: 47: Hoare triple {19324#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19324#false} is VALID [2022-04-08 08:41:26,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {19324#false} ~skip~0 := 0; {19324#false} is VALID [2022-04-08 08:41:26,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {19324#false} assume !false; {19324#false} is VALID [2022-04-08 08:41:26,412 INFO L290 TraceCheckUtils]: 50: Hoare triple {19324#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); {19324#false} is VALID [2022-04-08 08:41:26,412 INFO L290 TraceCheckUtils]: 51: Hoare triple {19324#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,412 INFO L290 TraceCheckUtils]: 52: Hoare triple {19324#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,412 INFO L290 TraceCheckUtils]: 53: Hoare triple {19324#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {19324#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 55: Hoare triple {19324#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 56: Hoare triple {19324#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 57: Hoare triple {19324#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 58: Hoare triple {19324#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 59: Hoare triple {19324#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 60: Hoare triple {19324#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 61: Hoare triple {19324#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 62: Hoare triple {19324#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 63: Hoare triple {19324#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 64: Hoare triple {19324#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 65: Hoare triple {19324#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 66: Hoare triple {19324#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 67: Hoare triple {19324#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 68: Hoare triple {19324#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 69: Hoare triple {19324#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 70: Hoare triple {19324#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,413 INFO L290 TraceCheckUtils]: 71: Hoare triple {19324#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,414 INFO L290 TraceCheckUtils]: 72: Hoare triple {19324#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,414 INFO L290 TraceCheckUtils]: 73: Hoare triple {19324#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,414 INFO L290 TraceCheckUtils]: 74: Hoare triple {19324#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,414 INFO L290 TraceCheckUtils]: 75: Hoare triple {19324#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,414 INFO L290 TraceCheckUtils]: 76: Hoare triple {19324#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,414 INFO L290 TraceCheckUtils]: 77: Hoare triple {19324#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,414 INFO L290 TraceCheckUtils]: 78: Hoare triple {19324#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-08 08:41:26,414 INFO L290 TraceCheckUtils]: 79: Hoare triple {19324#false} assume 8640 == #t~mem75;havoc #t~mem75; {19324#false} is VALID [2022-04-08 08:41:26,414 INFO L290 TraceCheckUtils]: 80: Hoare triple {19324#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {19324#false} is VALID [2022-04-08 08:41:26,414 INFO L290 TraceCheckUtils]: 81: Hoare triple {19324#false} assume 5 == ~blastFlag~0; {19324#false} is VALID [2022-04-08 08:41:26,414 INFO L290 TraceCheckUtils]: 82: Hoare triple {19324#false} assume !false; {19324#false} is VALID [2022-04-08 08:41:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:41:26,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:26,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966470227] [2022-04-08 08:41:26,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966470227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:26,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:26,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:26,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:26,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1740713974] [2022-04-08 08:41:26,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1740713974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:26,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:26,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:26,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560963501] [2022-04-08 08:41:26,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:26,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 83 [2022-04-08 08:41:26,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:26,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-08 08:41:26,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:26,467 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:26,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:26,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:26,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:26,467 INFO L87 Difference]: Start difference. First operand 377 states and 620 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:30,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:34,264 INFO L93 Difference]: Finished difference Result 816 states and 1328 transitions. [2022-04-08 08:41:34,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:34,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 08:41:34,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 08:41:34,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 08:41:34,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-08 08:41:34,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:34,639 INFO L225 Difference]: With dead ends: 816 [2022-04-08 08:41:34,639 INFO L226 Difference]: Without dead ends: 454 [2022-04-08 08:41:34,639 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:41:34,640 INFO L913 BasicCegarLoop]: 142 mSDtfsCounter, 118 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 58 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:34,640 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 392 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 501 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2022-04-08 08:41:34,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-04-08 08:41:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 377. [2022-04-08 08:41:34,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:34,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 454 states. Second operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:34,654 INFO L74 IsIncluded]: Start isIncluded. First operand 454 states. Second operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:34,654 INFO L87 Difference]: Start difference. First operand 454 states. Second operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:34,661 INFO L93 Difference]: Finished difference Result 454 states and 725 transitions. [2022-04-08 08:41:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 725 transitions. [2022-04-08 08:41:34,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:34,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:34,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 454 states. [2022-04-08 08:41:34,663 INFO L87 Difference]: Start difference. First operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 454 states. [2022-04-08 08:41:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:34,671 INFO L93 Difference]: Finished difference Result 454 states and 725 transitions. [2022-04-08 08:41:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 725 transitions. [2022-04-08 08:41:34,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:34,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:34,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:34,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:34,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 618 transitions. [2022-04-08 08:41:34,678 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 618 transitions. Word has length 83 [2022-04-08 08:41:34,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:34,678 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 618 transitions. [2022-04-08 08:41:34,678 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:34,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 618 transitions. [2022-04-08 08:41:35,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:35,121 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 618 transitions. [2022-04-08 08:41:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 08:41:35,122 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:35,122 INFO L499 BasicCegarLoop]: trace histogram [3, 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] [2022-04-08 08:41:35,122 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:41:35,122 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:35,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:35,122 INFO L85 PathProgramCache]: Analyzing trace with hash -724966751, now seen corresponding path program 1 times [2022-04-08 08:41:35,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:35,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [673271703] [2022-04-08 08:41:35,159 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:35,159 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:35,160 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:35,160 INFO L85 PathProgramCache]: Analyzing trace with hash -724966751, now seen corresponding path program 2 times [2022-04-08 08:41:35,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:35,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448726448] [2022-04-08 08:41:35,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:35,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:35,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:35,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {22636#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22629#true} is VALID [2022-04-08 08:41:35,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {22629#true} assume true; {22629#true} is VALID [2022-04-08 08:41:35,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22629#true} {22629#true} #689#return; {22629#true} is VALID [2022-04-08 08:41:35,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {22629#true} call ULTIMATE.init(); {22636#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:35,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {22636#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22629#true} is VALID [2022-04-08 08:41:35,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {22629#true} assume true; {22629#true} is VALID [2022-04-08 08:41:35,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22629#true} {22629#true} #689#return; {22629#true} is VALID [2022-04-08 08:41:35,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {22629#true} call #t~ret161 := main(); {22629#true} is VALID [2022-04-08 08:41:35,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {22629#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; {22629#true} is VALID [2022-04-08 08:41:35,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {22629#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22629#true} is VALID [2022-04-08 08:41:35,250 INFO L272 TraceCheckUtils]: 7: Hoare triple {22629#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22629#true} is VALID [2022-04-08 08:41:35,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {22629#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); {22634#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:35,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {22634#(= 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; {22634#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:35,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {22634#(= 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; {22634#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:35,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {22634#(= 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)))); {22634#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:35,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {22634#(= 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); {22634#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:35,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {22634#(= 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; {22634#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:35,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {22634#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {22634#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:35,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {22634#(= 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); {22634#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:35,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {22634#(= 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); {22634#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:35,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {22634#(= 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); {22634#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:35,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {22634#(= 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); {22634#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:35,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {22634#(= 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); {22634#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:35,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {22634#(= 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); {22635#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-08 08:41:35,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {22635#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {22630#false} is VALID [2022-04-08 08:41:35,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {22630#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; {22630#false} is VALID [2022-04-08 08:41:35,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {22630#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); {22630#false} is VALID [2022-04-08 08:41:35,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {22630#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); {22630#false} is VALID [2022-04-08 08:41:35,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {22630#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22630#false} is VALID [2022-04-08 08:41:35,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {22630#false} ~skip~0 := 0; {22630#false} is VALID [2022-04-08 08:41:35,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {22630#false} assume !false; {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 28: Hoare triple {22630#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); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {22630#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {22630#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {22630#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {22630#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {22630#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {22630#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {22630#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {22630#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {22630#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {22630#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {22630#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {22630#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {22630#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {22630#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {22630#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {22630#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {22630#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {22630#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 47: Hoare triple {22630#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 48: Hoare triple {22630#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 49: Hoare triple {22630#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 50: Hoare triple {22630#false} assume 8448 == #t~mem68;havoc #t~mem68; {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 51: Hoare triple {22630#false} assume !(~num1~0 > 0); {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 52: Hoare triple {22630#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; {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 53: Hoare triple {22630#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); {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 54: Hoare triple {22630#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 55: Hoare triple {22630#false} ~skip~0 := 0; {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 56: Hoare triple {22630#false} assume !false; {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 57: Hoare triple {22630#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); {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 58: Hoare triple {22630#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 59: Hoare triple {22630#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 60: Hoare triple {22630#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 61: Hoare triple {22630#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 62: Hoare triple {22630#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 63: Hoare triple {22630#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,258 INFO L290 TraceCheckUtils]: 64: Hoare triple {22630#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 65: Hoare triple {22630#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 66: Hoare triple {22630#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 67: Hoare triple {22630#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 68: Hoare triple {22630#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 69: Hoare triple {22630#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 70: Hoare triple {22630#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 71: Hoare triple {22630#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 72: Hoare triple {22630#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 73: Hoare triple {22630#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 74: Hoare triple {22630#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 75: Hoare triple {22630#false} assume 8544 == #t~mem64;havoc #t~mem64; {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 76: Hoare triple {22630#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 77: Hoare triple {22630#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 78: Hoare triple {22630#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 79: Hoare triple {22630#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 80: Hoare triple {22630#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 81: Hoare triple {22630#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {22630#false} is VALID [2022-04-08 08:41:35,259 INFO L290 TraceCheckUtils]: 82: Hoare triple {22630#false} assume 8 == ~blastFlag~0; {22630#false} is VALID [2022-04-08 08:41:35,260 INFO L290 TraceCheckUtils]: 83: Hoare triple {22630#false} assume !false; {22630#false} is VALID [2022-04-08 08:41:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 08:41:35,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:35,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448726448] [2022-04-08 08:41:35,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448726448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:35,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:35,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:35,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:35,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [673271703] [2022-04-08 08:41:35,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [673271703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:35,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:35,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:35,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450263168] [2022-04-08 08:41:35,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:35,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-08 08:41:35,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:35,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:35,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:35,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:35,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:35,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:35,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:35,312 INFO L87 Difference]: Start difference. First operand 377 states and 618 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:37,440 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-08 08:41:41,238 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:42,179 INFO L93 Difference]: Finished difference Result 813 states and 1325 transitions. [2022-04-08 08:41:42,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:42,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-08 08:41:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2022-04-08 08:41:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2022-04-08 08:41:42,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 519 transitions. [2022-04-08 08:41:42,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 519 edges. 519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:42,503 INFO L225 Difference]: With dead ends: 813 [2022-04-08 08:41:42,504 INFO L226 Difference]: Without dead ends: 451 [2022-04-08 08:41:42,504 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:41:42,505 INFO L913 BasicCegarLoop]: 151 mSDtfsCounter, 83 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:42,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 411 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-08 08:41:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-04-08 08:41:42,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 385. [2022-04-08 08:41:42,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:42,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand has 385 states, 380 states have (on average 1.65) internal successors, (627), 380 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:42,523 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand has 385 states, 380 states have (on average 1.65) internal successors, (627), 380 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:42,524 INFO L87 Difference]: Start difference. First operand 451 states. Second operand has 385 states, 380 states have (on average 1.65) internal successors, (627), 380 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:42,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:42,531 INFO L93 Difference]: Finished difference Result 451 states and 725 transitions. [2022-04-08 08:41:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 725 transitions. [2022-04-08 08:41:42,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:42,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:42,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 380 states have (on average 1.65) internal successors, (627), 380 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 451 states. [2022-04-08 08:41:42,533 INFO L87 Difference]: Start difference. First operand has 385 states, 380 states have (on average 1.65) internal successors, (627), 380 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 451 states. [2022-04-08 08:41:42,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:42,541 INFO L93 Difference]: Finished difference Result 451 states and 725 transitions. [2022-04-08 08:41:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 725 transitions. [2022-04-08 08:41:42,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:42,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:42,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:42,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 380 states have (on average 1.65) internal successors, (627), 380 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 631 transitions. [2022-04-08 08:41:42,550 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 631 transitions. Word has length 84 [2022-04-08 08:41:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:42,550 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 631 transitions. [2022-04-08 08:41:42,550 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:42,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 631 transitions. [2022-04-08 08:41:43,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 631 transitions. [2022-04-08 08:41:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 08:41:43,033 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:43,033 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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-08 08:41:43,034 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:41:43,034 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:43,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:43,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1180490630, now seen corresponding path program 1 times [2022-04-08 08:41:43,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:43,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [351898445] [2022-04-08 08:41:43,084 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:43,084 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:43,084 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1180490630, now seen corresponding path program 2 times [2022-04-08 08:41:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:43,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548868605] [2022-04-08 08:41:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:43,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:43,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {25946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25939#true} is VALID [2022-04-08 08:41:43,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {25939#true} assume true; {25939#true} is VALID [2022-04-08 08:41:43,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25939#true} {25939#true} #689#return; {25939#true} is VALID [2022-04-08 08:41:43,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {25939#true} call ULTIMATE.init(); {25946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:43,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {25946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25939#true} is VALID [2022-04-08 08:41:43,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {25939#true} assume true; {25939#true} is VALID [2022-04-08 08:41:43,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25939#true} {25939#true} #689#return; {25939#true} is VALID [2022-04-08 08:41:43,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {25939#true} call #t~ret161 := main(); {25939#true} is VALID [2022-04-08 08:41:43,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {25939#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; {25939#true} is VALID [2022-04-08 08:41:43,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {25939#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {25939#true} is VALID [2022-04-08 08:41:43,220 INFO L272 TraceCheckUtils]: 7: Hoare triple {25939#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25939#true} is VALID [2022-04-08 08:41:43,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {25939#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); {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:43,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} 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; {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:43,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} 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; {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:43,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:43,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:43,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:43,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:43,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {25944#(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); {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:43,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {25944#(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); {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:43,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {25944#(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); {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:43,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {25944#(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); {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:43,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {25944#(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); {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:43,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {25944#(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); {25944#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:43,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {25944#(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); {25945#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-08 08:41:43,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {25945#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {25940#false} is VALID [2022-04-08 08:41:43,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {25940#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; {25940#false} is VALID [2022-04-08 08:41:43,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {25940#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); {25940#false} is VALID [2022-04-08 08:41:43,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {25940#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); {25940#false} is VALID [2022-04-08 08:41:43,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {25940#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25940#false} is VALID [2022-04-08 08:41:43,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {25940#false} ~skip~0 := 0; {25940#false} is VALID [2022-04-08 08:41:43,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {25940#false} assume !false; {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {25940#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); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {25940#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {25940#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {25940#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {25940#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {25940#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {25940#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {25940#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {25940#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {25940#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {25940#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {25940#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {25940#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {25940#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {25940#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {25940#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {25940#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {25940#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 47: Hoare triple {25940#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 48: Hoare triple {25940#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {25940#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {25940#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {25940#false} assume 8448 == #t~mem68;havoc #t~mem68; {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {25940#false} assume !(~num1~0 > 0); {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {25940#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; {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {25940#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); {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 55: Hoare triple {25940#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 56: Hoare triple {25940#false} ~skip~0 := 0; {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 57: Hoare triple {25940#false} assume !false; {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 58: Hoare triple {25940#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); {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 59: Hoare triple {25940#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 60: Hoare triple {25940#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 61: Hoare triple {25940#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 62: Hoare triple {25940#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 63: Hoare triple {25940#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,228 INFO L290 TraceCheckUtils]: 64: Hoare triple {25940#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 65: Hoare triple {25940#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 66: Hoare triple {25940#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 67: Hoare triple {25940#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 68: Hoare triple {25940#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 69: Hoare triple {25940#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 70: Hoare triple {25940#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 71: Hoare triple {25940#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 72: Hoare triple {25940#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 73: Hoare triple {25940#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 74: Hoare triple {25940#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 75: Hoare triple {25940#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 76: Hoare triple {25940#false} assume 8544 == #t~mem64;havoc #t~mem64; {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 77: Hoare triple {25940#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 78: Hoare triple {25940#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 79: Hoare triple {25940#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 80: Hoare triple {25940#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 81: Hoare triple {25940#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 82: Hoare triple {25940#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {25940#false} is VALID [2022-04-08 08:41:43,229 INFO L290 TraceCheckUtils]: 83: Hoare triple {25940#false} assume 8 == ~blastFlag~0; {25940#false} is VALID [2022-04-08 08:41:43,230 INFO L290 TraceCheckUtils]: 84: Hoare triple {25940#false} assume !false; {25940#false} is VALID [2022-04-08 08:41:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 08:41:43,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:43,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548868605] [2022-04-08 08:41:43,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548868605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:43,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:43,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:43,230 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:43,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [351898445] [2022-04-08 08:41:43,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [351898445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:43,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:43,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78700108] [2022-04-08 08:41:43,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:43,231 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 85 [2022-04-08 08:41:43,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:43,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:43,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:43,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:43,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:43,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:43,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:43,279 INFO L87 Difference]: Start difference. First operand 385 states and 631 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:47,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:48,998 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:50,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:51,704 INFO L93 Difference]: Finished difference Result 824 states and 1337 transitions. [2022-04-08 08:41:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:51,704 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 85 [2022-04-08 08:41:51,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-08 08:41:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-08 08:41:51,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-08 08:41:52,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:52,084 INFO L225 Difference]: With dead ends: 824 [2022-04-08 08:41:52,084 INFO L226 Difference]: Without dead ends: 462 [2022-04-08 08:41:52,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:41:52,086 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 138 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:52,086 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-08 08:41:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-04-08 08:41:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 385. [2022-04-08 08:41:52,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:52,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 462 states. Second operand has 385 states, 380 states have (on average 1.631578947368421) internal successors, (620), 380 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:52,101 INFO L74 IsIncluded]: Start isIncluded. First operand 462 states. Second operand has 385 states, 380 states have (on average 1.631578947368421) internal successors, (620), 380 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:52,102 INFO L87 Difference]: Start difference. First operand 462 states. Second operand has 385 states, 380 states have (on average 1.631578947368421) internal successors, (620), 380 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:52,110 INFO L93 Difference]: Finished difference Result 462 states and 731 transitions. [2022-04-08 08:41:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 731 transitions. [2022-04-08 08:41:52,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:52,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:52,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 380 states have (on average 1.631578947368421) internal successors, (620), 380 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 462 states. [2022-04-08 08:41:52,112 INFO L87 Difference]: Start difference. First operand has 385 states, 380 states have (on average 1.631578947368421) internal successors, (620), 380 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 462 states. [2022-04-08 08:41:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:52,120 INFO L93 Difference]: Finished difference Result 462 states and 731 transitions. [2022-04-08 08:41:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 731 transitions. [2022-04-08 08:41:52,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:52,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:52,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:52,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:52,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 380 states have (on average 1.631578947368421) internal successors, (620), 380 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 624 transitions. [2022-04-08 08:41:52,129 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 624 transitions. Word has length 85 [2022-04-08 08:41:52,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:52,129 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 624 transitions. [2022-04-08 08:41:52,129 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:52,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 624 transitions. [2022-04-08 08:41:52,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 624 edges. 624 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 624 transitions. [2022-04-08 08:41:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 08:41:52,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:52,604 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 08:41:52,604 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:41:52,604 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash -289742090, now seen corresponding path program 1 times [2022-04-08 08:41:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:52,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1059749980] [2022-04-08 08:41:52,656 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:52,656 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:52,656 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:52,656 INFO L85 PathProgramCache]: Analyzing trace with hash -289742090, now seen corresponding path program 2 times [2022-04-08 08:41:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:52,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169408427] [2022-04-08 08:41:52,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:52,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:52,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {29300#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29293#true} is VALID [2022-04-08 08:41:52,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {29293#true} assume true; {29293#true} is VALID [2022-04-08 08:41:52,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29293#true} {29293#true} #689#return; {29293#true} is VALID [2022-04-08 08:41:52,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {29293#true} call ULTIMATE.init(); {29300#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:52,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {29300#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29293#true} is VALID [2022-04-08 08:41:52,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {29293#true} assume true; {29293#true} is VALID [2022-04-08 08:41:52,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29293#true} {29293#true} #689#return; {29293#true} is VALID [2022-04-08 08:41:52,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {29293#true} call #t~ret161 := main(); {29293#true} is VALID [2022-04-08 08:41:52,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {29293#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; {29293#true} is VALID [2022-04-08 08:41:52,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {29293#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {29293#true} is VALID [2022-04-08 08:41:52,758 INFO L272 TraceCheckUtils]: 7: Hoare triple {29293#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {29293#true} is VALID [2022-04-08 08:41:52,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {29293#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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {29298#(not (= 8672 (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; {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {29298#(not (= 8672 (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; {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {29298#(not (= 8672 (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)))); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {29298#(not (= 8672 (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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {29298#(not (= 8672 (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; {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {29298#(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); {29298#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:52,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {29298#(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); {29299#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-08 08:41:52,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {29299#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {29294#false} is VALID [2022-04-08 08:41:52,778 INFO L290 TraceCheckUtils]: 49: Hoare triple {29294#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {29294#false} is VALID [2022-04-08 08:41:52,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {29294#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {29294#false} is VALID [2022-04-08 08:41:52,778 INFO L290 TraceCheckUtils]: 51: Hoare triple {29294#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); {29294#false} is VALID [2022-04-08 08:41:52,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {29294#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; {29294#false} is VALID [2022-04-08 08:41:52,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {29294#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,778 INFO L290 TraceCheckUtils]: 54: Hoare triple {29294#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); {29294#false} is VALID [2022-04-08 08:41:52,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {29294#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29294#false} is VALID [2022-04-08 08:41:52,778 INFO L290 TraceCheckUtils]: 56: Hoare triple {29294#false} ~skip~0 := 0; {29294#false} is VALID [2022-04-08 08:41:52,778 INFO L290 TraceCheckUtils]: 57: Hoare triple {29294#false} assume !false; {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 58: Hoare triple {29294#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); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 59: Hoare triple {29294#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 60: Hoare triple {29294#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 61: Hoare triple {29294#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 62: Hoare triple {29294#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 63: Hoare triple {29294#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 64: Hoare triple {29294#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 65: Hoare triple {29294#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 66: Hoare triple {29294#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 67: Hoare triple {29294#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 68: Hoare triple {29294#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 69: Hoare triple {29294#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 70: Hoare triple {29294#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 71: Hoare triple {29294#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 72: Hoare triple {29294#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,779 INFO L290 TraceCheckUtils]: 73: Hoare triple {29294#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,780 INFO L290 TraceCheckUtils]: 74: Hoare triple {29294#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,780 INFO L290 TraceCheckUtils]: 75: Hoare triple {29294#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,780 INFO L290 TraceCheckUtils]: 76: Hoare triple {29294#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,780 INFO L290 TraceCheckUtils]: 77: Hoare triple {29294#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,780 INFO L290 TraceCheckUtils]: 78: Hoare triple {29294#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,780 INFO L290 TraceCheckUtils]: 79: Hoare triple {29294#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,780 INFO L290 TraceCheckUtils]: 80: Hoare triple {29294#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,780 INFO L290 TraceCheckUtils]: 81: Hoare triple {29294#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,780 INFO L290 TraceCheckUtils]: 82: Hoare triple {29294#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,780 INFO L290 TraceCheckUtils]: 83: Hoare triple {29294#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,780 INFO L290 TraceCheckUtils]: 84: Hoare triple {29294#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,780 INFO L290 TraceCheckUtils]: 85: Hoare triple {29294#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,781 INFO L290 TraceCheckUtils]: 86: Hoare triple {29294#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {29294#false} is VALID [2022-04-08 08:41:52,781 INFO L290 TraceCheckUtils]: 87: Hoare triple {29294#false} assume 8640 == #t~mem75;havoc #t~mem75; {29294#false} is VALID [2022-04-08 08:41:52,781 INFO L290 TraceCheckUtils]: 88: Hoare triple {29294#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {29294#false} is VALID [2022-04-08 08:41:52,781 INFO L290 TraceCheckUtils]: 89: Hoare triple {29294#false} assume 5 == ~blastFlag~0; {29294#false} is VALID [2022-04-08 08:41:52,781 INFO L290 TraceCheckUtils]: 90: Hoare triple {29294#false} assume !false; {29294#false} is VALID [2022-04-08 08:41:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:41:52,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:52,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169408427] [2022-04-08 08:41:52,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169408427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:52,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:52,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:52,782 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:52,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1059749980] [2022-04-08 08:41:52,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1059749980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:52,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:52,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:52,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109778825] [2022-04-08 08:41:52,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:52,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-08 08:41:52,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:52,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:52,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:52,838 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:52,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:52,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:52,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:52,838 INFO L87 Difference]: Start difference. First operand 385 states and 624 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:58,720 INFO L93 Difference]: Finished difference Result 864 states and 1388 transitions. [2022-04-08 08:41:58,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:58,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-08 08:41:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-08 08:41:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-08 08:41:58,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-08 08:41:59,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:59,095 INFO L225 Difference]: With dead ends: 864 [2022-04-08 08:41:59,095 INFO L226 Difference]: Without dead ends: 502 [2022-04-08 08:41:59,096 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:41:59,096 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 110 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:59,096 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 343 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-08 08:41:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-04-08 08:41:59,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 428. [2022-04-08 08:41:59,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:59,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 502 states. Second operand has 428 states, 423 states have (on average 1.6312056737588652) internal successors, (690), 423 states have internal predecessors, (690), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:59,114 INFO L74 IsIncluded]: Start isIncluded. First operand 502 states. Second operand has 428 states, 423 states have (on average 1.6312056737588652) internal successors, (690), 423 states have internal predecessors, (690), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:59,114 INFO L87 Difference]: Start difference. First operand 502 states. Second operand has 428 states, 423 states have (on average 1.6312056737588652) internal successors, (690), 423 states have internal predecessors, (690), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:59,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:59,123 INFO L93 Difference]: Finished difference Result 502 states and 795 transitions. [2022-04-08 08:41:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 795 transitions. [2022-04-08 08:41:59,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:59,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:59,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 428 states, 423 states have (on average 1.6312056737588652) internal successors, (690), 423 states have internal predecessors, (690), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 502 states. [2022-04-08 08:41:59,125 INFO L87 Difference]: Start difference. First operand has 428 states, 423 states have (on average 1.6312056737588652) internal successors, (690), 423 states have internal predecessors, (690), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 502 states. [2022-04-08 08:41:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:59,134 INFO L93 Difference]: Finished difference Result 502 states and 795 transitions. [2022-04-08 08:41:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 795 transitions. [2022-04-08 08:41:59,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:59,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:59,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:59,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 423 states have (on average 1.6312056737588652) internal successors, (690), 423 states have internal predecessors, (690), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 694 transitions. [2022-04-08 08:41:59,143 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 694 transitions. Word has length 91 [2022-04-08 08:41:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:59,143 INFO L478 AbstractCegarLoop]: Abstraction has 428 states and 694 transitions. [2022-04-08 08:41:59,143 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:59,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 428 states and 694 transitions. [2022-04-08 08:41:59,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 694 edges. 694 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 694 transitions. [2022-04-08 08:41:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 08:41:59,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:59,684 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:59,684 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:41:59,684 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:59,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2016065217, now seen corresponding path program 1 times [2022-04-08 08:41:59,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:59,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1126594602] [2022-04-08 08:41:59,726 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:59,726 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:59,726 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:59,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2016065217, now seen corresponding path program 2 times [2022-04-08 08:41:59,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:59,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253032043] [2022-04-08 08:41:59,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:59,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:59,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:59,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {32900#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32893#true} is VALID [2022-04-08 08:41:59,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {32893#true} assume true; {32893#true} is VALID [2022-04-08 08:41:59,815 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32893#true} {32893#true} #689#return; {32893#true} is VALID [2022-04-08 08:41:59,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {32893#true} call ULTIMATE.init(); {32900#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:59,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {32900#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32893#true} is VALID [2022-04-08 08:41:59,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {32893#true} assume true; {32893#true} is VALID [2022-04-08 08:41:59,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32893#true} {32893#true} #689#return; {32893#true} is VALID [2022-04-08 08:41:59,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {32893#true} call #t~ret161 := main(); {32893#true} is VALID [2022-04-08 08:41:59,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {32893#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; {32893#true} is VALID [2022-04-08 08:41:59,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {32893#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {32893#true} is VALID [2022-04-08 08:41:59,816 INFO L272 TraceCheckUtils]: 7: Hoare triple {32893#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32893#true} is VALID [2022-04-08 08:41:59,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {32893#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); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} 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; {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} 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; {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !false; {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:41:59,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {32898#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {32899#(not (= |ssl3_accept_#t~mem60| 8512))} is VALID [2022-04-08 08:41:59,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {32899#(not (= |ssl3_accept_#t~mem60| 8512))} assume 8512 == #t~mem60;havoc #t~mem60; {32894#false} is VALID [2022-04-08 08:41:59,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {32894#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {32894#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {32894#false} is VALID [2022-04-08 08:41:59,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {32894#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {32894#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); {32894#false} is VALID [2022-04-08 08:41:59,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {32894#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32894#false} is VALID [2022-04-08 08:41:59,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {32894#false} ~skip~0 := 0; {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {32894#false} assume !false; {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {32894#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); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {32894#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {32894#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {32894#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {32894#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {32894#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {32894#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {32894#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 45: Hoare triple {32894#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 46: Hoare triple {32894#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 47: Hoare triple {32894#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 48: Hoare triple {32894#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 49: Hoare triple {32894#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 50: Hoare triple {32894#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 51: Hoare triple {32894#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 52: Hoare triple {32894#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,825 INFO L290 TraceCheckUtils]: 53: Hoare triple {32894#false} assume 8528 == #t~mem62;havoc #t~mem62; {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 54: Hoare triple {32894#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 55: Hoare triple {32894#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 56: Hoare triple {32894#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 57: Hoare triple {32894#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 58: Hoare triple {32894#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 59: Hoare triple {32894#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 60: Hoare triple {32894#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 61: Hoare triple {32894#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); {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 62: Hoare triple {32894#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 63: Hoare triple {32894#false} ~skip~0 := 0; {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 64: Hoare triple {32894#false} assume !false; {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 65: Hoare triple {32894#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); {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 66: Hoare triple {32894#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 67: Hoare triple {32894#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 68: Hoare triple {32894#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 69: Hoare triple {32894#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 70: Hoare triple {32894#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,826 INFO L290 TraceCheckUtils]: 71: Hoare triple {32894#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 72: Hoare triple {32894#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 73: Hoare triple {32894#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 74: Hoare triple {32894#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 75: Hoare triple {32894#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 76: Hoare triple {32894#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 77: Hoare triple {32894#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 78: Hoare triple {32894#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 79: Hoare triple {32894#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 80: Hoare triple {32894#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 81: Hoare triple {32894#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 82: Hoare triple {32894#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 83: Hoare triple {32894#false} assume 8544 == #t~mem64;havoc #t~mem64; {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 84: Hoare triple {32894#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 85: Hoare triple {32894#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 86: Hoare triple {32894#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 87: Hoare triple {32894#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 88: Hoare triple {32894#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 89: Hoare triple {32894#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {32894#false} is VALID [2022-04-08 08:41:59,827 INFO L290 TraceCheckUtils]: 90: Hoare triple {32894#false} assume 8 == ~blastFlag~0; {32894#false} is VALID [2022-04-08 08:41:59,828 INFO L290 TraceCheckUtils]: 91: Hoare triple {32894#false} assume !false; {32894#false} is VALID [2022-04-08 08:41:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 08:41:59,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:59,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253032043] [2022-04-08 08:41:59,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253032043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:59,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:59,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:59,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:59,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1126594602] [2022-04-08 08:41:59,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1126594602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:59,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:59,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707034899] [2022-04-08 08:41:59,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:59,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-08 08:41:59,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:59,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:59,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:59,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:59,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:59,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:59,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:59,875 INFO L87 Difference]: Start difference. First operand 428 states and 694 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:03,000 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:06,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:08,518 INFO L93 Difference]: Finished difference Result 954 states and 1534 transitions. [2022-04-08 08:42:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:08,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-08 08:42:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-08 08:42:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-08 08:42:08,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-08 08:42:08,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:08,886 INFO L225 Difference]: With dead ends: 954 [2022-04-08 08:42:08,886 INFO L226 Difference]: Without dead ends: 549 [2022-04-08 08:42:08,887 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:42:08,887 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 130 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:08,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 478 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-04-08 08:42:08,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-04-08 08:42:08,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 453. [2022-04-08 08:42:08,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:08,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 549 states. Second operand has 453 states, 448 states have (on average 1.6183035714285714) internal successors, (725), 448 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:08,908 INFO L74 IsIncluded]: Start isIncluded. First operand 549 states. Second operand has 453 states, 448 states have (on average 1.6183035714285714) internal successors, (725), 448 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:08,908 INFO L87 Difference]: Start difference. First operand 549 states. Second operand has 453 states, 448 states have (on average 1.6183035714285714) internal successors, (725), 448 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:08,918 INFO L93 Difference]: Finished difference Result 549 states and 864 transitions. [2022-04-08 08:42:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 864 transitions. [2022-04-08 08:42:08,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:08,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:08,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 453 states, 448 states have (on average 1.6183035714285714) internal successors, (725), 448 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 549 states. [2022-04-08 08:42:08,919 INFO L87 Difference]: Start difference. First operand has 453 states, 448 states have (on average 1.6183035714285714) internal successors, (725), 448 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 549 states. [2022-04-08 08:42:08,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:08,929 INFO L93 Difference]: Finished difference Result 549 states and 864 transitions. [2022-04-08 08:42:08,929 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 864 transitions. [2022-04-08 08:42:08,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:08,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:08,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:08,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 448 states have (on average 1.6183035714285714) internal successors, (725), 448 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:08,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 729 transitions. [2022-04-08 08:42:08,940 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 729 transitions. Word has length 92 [2022-04-08 08:42:08,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:08,940 INFO L478 AbstractCegarLoop]: Abstraction has 453 states and 729 transitions. [2022-04-08 08:42:08,940 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:08,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 453 states and 729 transitions. [2022-04-08 08:42:09,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 729 edges. 729 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:09,546 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 729 transitions. [2022-04-08 08:42:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 08:42:09,547 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:09,547 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-04-08 08:42:09,547 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:42:09,547 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:09,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:09,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1117221866, now seen corresponding path program 1 times [2022-04-08 08:42:09,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:09,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1655863827] [2022-04-08 08:42:09,600 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:09,600 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:09,600 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1117221866, now seen corresponding path program 2 times [2022-04-08 08:42:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:09,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380212989] [2022-04-08 08:42:09,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:09,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:09,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {36824#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36817#true} is VALID [2022-04-08 08:42:09,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {36817#true} assume true; {36817#true} is VALID [2022-04-08 08:42:09,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36817#true} {36817#true} #689#return; {36817#true} is VALID [2022-04-08 08:42:09,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {36817#true} call ULTIMATE.init(); {36824#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:42:09,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {36824#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36817#true} is VALID [2022-04-08 08:42:09,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {36817#true} assume true; {36817#true} is VALID [2022-04-08 08:42:09,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36817#true} {36817#true} #689#return; {36817#true} is VALID [2022-04-08 08:42:09,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {36817#true} call #t~ret161 := main(); {36817#true} is VALID [2022-04-08 08:42:09,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {36817#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; {36817#true} is VALID [2022-04-08 08:42:09,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {36817#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {36817#true} is VALID [2022-04-08 08:42:09,698 INFO L272 TraceCheckUtils]: 7: Hoare triple {36817#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {36817#true} is VALID [2022-04-08 08:42:09,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {36817#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); {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {36822#(= 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; {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {36822#(= 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; {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {36822#(= 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)))); {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {36822#(= 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); {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {36822#(= 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; {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {36822#(= 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); {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {36822#(= 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); {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {36822#(= 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); {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {36822#(= 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); {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {36822#(= 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); {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {36822#(= 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); {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {36822#(= 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); {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {36822#(= 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); {36822#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:09,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {36822#(= 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); {36823#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-08 08:42:09,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {36823#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {36818#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {36818#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {36818#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {36818#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {36818#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {36818#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {36818#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {36818#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {36818#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {36818#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {36818#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {36818#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {36818#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {36818#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 39: Hoare triple {36818#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {36818#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {36818#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 42: Hoare triple {36818#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {36818#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {36818#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {36818#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {36818#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {36818#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {36818#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {36818#false} assume 8673 == #t~mem80;havoc #t~mem80; {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 50: Hoare triple {36818#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {36818#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {36818#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); {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {36818#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; {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 54: Hoare triple {36818#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 55: Hoare triple {36818#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); {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 56: Hoare triple {36818#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 57: Hoare triple {36818#false} ~skip~0 := 0; {36818#false} is VALID [2022-04-08 08:42:09,714 INFO L290 TraceCheckUtils]: 58: Hoare triple {36818#false} assume !false; {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 59: Hoare triple {36818#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); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 60: Hoare triple {36818#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 61: Hoare triple {36818#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 62: Hoare triple {36818#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 63: Hoare triple {36818#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 64: Hoare triple {36818#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 65: Hoare triple {36818#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 66: Hoare triple {36818#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 67: Hoare triple {36818#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 68: Hoare triple {36818#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 69: Hoare triple {36818#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 70: Hoare triple {36818#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 71: Hoare triple {36818#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 72: Hoare triple {36818#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 73: Hoare triple {36818#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 74: Hoare triple {36818#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 75: Hoare triple {36818#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,715 INFO L290 TraceCheckUtils]: 76: Hoare triple {36818#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 77: Hoare triple {36818#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 78: Hoare triple {36818#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 79: Hoare triple {36818#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 80: Hoare triple {36818#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 81: Hoare triple {36818#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 82: Hoare triple {36818#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 83: Hoare triple {36818#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 84: Hoare triple {36818#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 85: Hoare triple {36818#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 86: Hoare triple {36818#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 87: Hoare triple {36818#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 88: Hoare triple {36818#false} assume 8640 == #t~mem75;havoc #t~mem75; {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 89: Hoare triple {36818#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 90: Hoare triple {36818#false} assume 5 == ~blastFlag~0; {36818#false} is VALID [2022-04-08 08:42:09,716 INFO L290 TraceCheckUtils]: 91: Hoare triple {36818#false} assume !false; {36818#false} is VALID [2022-04-08 08:42:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 08:42:09,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:09,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380212989] [2022-04-08 08:42:09,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380212989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:09,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:09,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:09,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:09,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1655863827] [2022-04-08 08:42:09,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1655863827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:09,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:09,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:09,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421438418] [2022-04-08 08:42:09,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:09,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-08 08:42:09,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:09,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:09,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:09,765 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:09,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:09,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:09,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:09,766 INFO L87 Difference]: Start difference. First operand 453 states and 729 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:16,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:18,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:18,141 INFO L93 Difference]: Finished difference Result 901 states and 1450 transitions. [2022-04-08 08:42:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:18,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-08 08:42:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2022-04-08 08:42:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2022-04-08 08:42:18,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 448 transitions. [2022-04-08 08:42:18,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:18,405 INFO L225 Difference]: With dead ends: 901 [2022-04-08 08:42:18,405 INFO L226 Difference]: Without dead ends: 471 [2022-04-08 08:42:18,406 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:42:18,406 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 20 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:18,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 485 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-08 08:42:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-04-08 08:42:18,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 456. [2022-04-08 08:42:18,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:18,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 471 states. Second operand has 456 states, 451 states have (on average 1.6164079822616408) internal successors, (729), 451 states have internal predecessors, (729), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:18,426 INFO L74 IsIncluded]: Start isIncluded. First operand 471 states. Second operand has 456 states, 451 states have (on average 1.6164079822616408) internal successors, (729), 451 states have internal predecessors, (729), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:18,427 INFO L87 Difference]: Start difference. First operand 471 states. Second operand has 456 states, 451 states have (on average 1.6164079822616408) internal successors, (729), 451 states have internal predecessors, (729), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:18,435 INFO L93 Difference]: Finished difference Result 471 states and 752 transitions. [2022-04-08 08:42:18,435 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 752 transitions. [2022-04-08 08:42:18,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:18,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:18,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 456 states, 451 states have (on average 1.6164079822616408) internal successors, (729), 451 states have internal predecessors, (729), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 471 states. [2022-04-08 08:42:18,436 INFO L87 Difference]: Start difference. First operand has 456 states, 451 states have (on average 1.6164079822616408) internal successors, (729), 451 states have internal predecessors, (729), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 471 states. [2022-04-08 08:42:18,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:18,444 INFO L93 Difference]: Finished difference Result 471 states and 752 transitions. [2022-04-08 08:42:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 752 transitions. [2022-04-08 08:42:18,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:18,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:18,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:18,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 451 states have (on average 1.6164079822616408) internal successors, (729), 451 states have internal predecessors, (729), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 733 transitions. [2022-04-08 08:42:18,455 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 733 transitions. Word has length 92 [2022-04-08 08:42:18,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:18,455 INFO L478 AbstractCegarLoop]: Abstraction has 456 states and 733 transitions. [2022-04-08 08:42:18,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:18,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 456 states and 733 transitions. [2022-04-08 08:42:19,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 733 edges. 733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 733 transitions. [2022-04-08 08:42:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 08:42:19,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:19,074 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-08 08:42:19,074 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:42:19,074 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:19,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash 340309531, now seen corresponding path program 1 times [2022-04-08 08:42:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:19,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [190104584] [2022-04-08 08:42:19,135 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:19,136 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:19,136 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:19,136 INFO L85 PathProgramCache]: Analyzing trace with hash 340309531, now seen corresponding path program 2 times [2022-04-08 08:42:19,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:19,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911790596] [2022-04-08 08:42:19,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:19,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:19,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:19,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {40492#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40485#true} is VALID [2022-04-08 08:42:19,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {40485#true} assume true; {40485#true} is VALID [2022-04-08 08:42:19,262 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40485#true} {40485#true} #689#return; {40485#true} is VALID [2022-04-08 08:42:19,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {40485#true} call ULTIMATE.init(); {40492#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:42:19,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {40492#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40485#true} is VALID [2022-04-08 08:42:19,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {40485#true} assume true; {40485#true} is VALID [2022-04-08 08:42:19,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40485#true} {40485#true} #689#return; {40485#true} is VALID [2022-04-08 08:42:19,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {40485#true} call #t~ret161 := main(); {40485#true} is VALID [2022-04-08 08:42:19,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {40485#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; {40485#true} is VALID [2022-04-08 08:42:19,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {40485#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {40485#true} is VALID [2022-04-08 08:42:19,263 INFO L272 TraceCheckUtils]: 7: Hoare triple {40485#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {40485#true} is VALID [2022-04-08 08:42:19,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {40485#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); {40490#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {40490#(= 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; {40490#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {40490#(= 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; {40490#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {40490#(= 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)))); {40490#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {40490#(= 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); {40490#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {40490#(= 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; {40490#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {40490#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {40490#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {40490#(= 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); {40491#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-08 08:42:19,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {40491#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {40486#false} is VALID [2022-04-08 08:42:19,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {40486#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {40486#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {40486#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {40486#false} is VALID [2022-04-08 08:42:19,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {40486#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {40486#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); {40486#false} is VALID [2022-04-08 08:42:19,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {40486#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {40486#false} is VALID [2022-04-08 08:42:19,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {40486#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); {40486#false} is VALID [2022-04-08 08:42:19,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {40486#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); {40486#false} is VALID [2022-04-08 08:42:19,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {40486#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); {40486#false} is VALID [2022-04-08 08:42:19,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {40486#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40486#false} is VALID [2022-04-08 08:42:19,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {40486#false} ~skip~0 := 0; {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {40486#false} assume !false; {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {40486#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); {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {40486#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {40486#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {40486#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {40486#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {40486#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {40486#false} assume 8480 == #t~mem52;havoc #t~mem52; {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {40486#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; {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {40486#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); {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {40486#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); {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {40486#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {40486#false} ~skip~0 := 0; {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {40486#false} assume !false; {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 42: Hoare triple {40486#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); {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {40486#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,269 INFO L290 TraceCheckUtils]: 44: Hoare triple {40486#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {40486#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {40486#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {40486#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {40486#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {40486#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {40486#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 51: Hoare triple {40486#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 52: Hoare triple {40486#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 53: Hoare triple {40486#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 54: Hoare triple {40486#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 55: Hoare triple {40486#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 56: Hoare triple {40486#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 57: Hoare triple {40486#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 58: Hoare triple {40486#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 59: Hoare triple {40486#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 60: Hoare triple {40486#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 61: Hoare triple {40486#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 62: Hoare triple {40486#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,270 INFO L290 TraceCheckUtils]: 63: Hoare triple {40486#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 64: Hoare triple {40486#false} assume 8448 == #t~mem68;havoc #t~mem68; {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 65: Hoare triple {40486#false} assume !(~num1~0 > 0); {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 66: Hoare triple {40486#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; {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 67: Hoare triple {40486#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); {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 68: Hoare triple {40486#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 69: Hoare triple {40486#false} ~skip~0 := 0; {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 70: Hoare triple {40486#false} assume !false; {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 71: Hoare triple {40486#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); {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 72: Hoare triple {40486#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 73: Hoare triple {40486#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 74: Hoare triple {40486#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 75: Hoare triple {40486#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 76: Hoare triple {40486#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 77: Hoare triple {40486#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 78: Hoare triple {40486#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 79: Hoare triple {40486#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 80: Hoare triple {40486#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 81: Hoare triple {40486#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,271 INFO L290 TraceCheckUtils]: 82: Hoare triple {40486#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 83: Hoare triple {40486#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 84: Hoare triple {40486#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 85: Hoare triple {40486#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 86: Hoare triple {40486#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 87: Hoare triple {40486#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 88: Hoare triple {40486#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 89: Hoare triple {40486#false} assume 8544 == #t~mem64;havoc #t~mem64; {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 90: Hoare triple {40486#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 91: Hoare triple {40486#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 92: Hoare triple {40486#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 93: Hoare triple {40486#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 94: Hoare triple {40486#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 95: Hoare triple {40486#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 96: Hoare triple {40486#false} assume 8 == ~blastFlag~0; {40486#false} is VALID [2022-04-08 08:42:19,272 INFO L290 TraceCheckUtils]: 97: Hoare triple {40486#false} assume !false; {40486#false} is VALID [2022-04-08 08:42:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 08:42:19,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:19,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911790596] [2022-04-08 08:42:19,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911790596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:19,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:19,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:19,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:19,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [190104584] [2022-04-08 08:42:19,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [190104584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:19,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:19,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832665140] [2022-04-08 08:42:19,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:19,274 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 98 [2022-04-08 08:42:19,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:19,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:19,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:19,316 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:19,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:19,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:19,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:19,316 INFO L87 Difference]: Start difference. First operand 456 states and 733 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:24,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:27,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:29,918 INFO L93 Difference]: Finished difference Result 900 states and 1448 transitions. [2022-04-08 08:42:29,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:29,918 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 98 [2022-04-08 08:42:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-04-08 08:42:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:29,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-04-08 08:42:29,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 446 transitions. [2022-04-08 08:42:30,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:30,194 INFO L225 Difference]: With dead ends: 900 [2022-04-08 08:42:30,194 INFO L226 Difference]: Without dead ends: 470 [2022-04-08 08:42:30,195 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:42:30,196 INFO L913 BasicCegarLoop]: 190 mSDtfsCounter, 27 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:30,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-08 08:42:30,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-04-08 08:42:30,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 456. [2022-04-08 08:42:30,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:30,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 470 states. Second operand has 456 states, 451 states have (on average 1.6141906873614191) internal successors, (728), 451 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:30,216 INFO L74 IsIncluded]: Start isIncluded. First operand 470 states. Second operand has 456 states, 451 states have (on average 1.6141906873614191) internal successors, (728), 451 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:30,216 INFO L87 Difference]: Start difference. First operand 470 states. Second operand has 456 states, 451 states have (on average 1.6141906873614191) internal successors, (728), 451 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:30,224 INFO L93 Difference]: Finished difference Result 470 states and 750 transitions. [2022-04-08 08:42:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 750 transitions. [2022-04-08 08:42:30,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:30,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:30,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 456 states, 451 states have (on average 1.6141906873614191) internal successors, (728), 451 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 470 states. [2022-04-08 08:42:30,225 INFO L87 Difference]: Start difference. First operand has 456 states, 451 states have (on average 1.6141906873614191) internal successors, (728), 451 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 470 states. [2022-04-08 08:42:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:30,233 INFO L93 Difference]: Finished difference Result 470 states and 750 transitions. [2022-04-08 08:42:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 750 transitions. [2022-04-08 08:42:30,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:30,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:30,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:30,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 451 states have (on average 1.6141906873614191) internal successors, (728), 451 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 732 transitions. [2022-04-08 08:42:30,243 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 732 transitions. Word has length 98 [2022-04-08 08:42:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:30,243 INFO L478 AbstractCegarLoop]: Abstraction has 456 states and 732 transitions. [2022-04-08 08:42:30,243 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:30,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 456 states and 732 transitions. [2022-04-08 08:42:30,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 732 edges. 732 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 732 transitions. [2022-04-08 08:42:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 08:42:30,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:30,829 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-08 08:42:30,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:42:30,829 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:30,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:30,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1628990895, now seen corresponding path program 1 times [2022-04-08 08:42:30,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:30,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1663038336] [2022-04-08 08:42:30,887 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:30,887 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:30,888 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:30,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1628990895, now seen corresponding path program 2 times [2022-04-08 08:42:30,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:30,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498905023] [2022-04-08 08:42:30,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:30,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:30,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:30,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {44156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {44149#true} is VALID [2022-04-08 08:42:30,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {44149#true} assume true; {44149#true} is VALID [2022-04-08 08:42:30,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44149#true} {44149#true} #689#return; {44149#true} is VALID [2022-04-08 08:42:30,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {44149#true} call ULTIMATE.init(); {44156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:42:30,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {44156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {44149#true} is VALID [2022-04-08 08:42:30,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {44149#true} assume true; {44149#true} is VALID [2022-04-08 08:42:30,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44149#true} {44149#true} #689#return; {44149#true} is VALID [2022-04-08 08:42:30,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {44149#true} call #t~ret161 := main(); {44149#true} is VALID [2022-04-08 08:42:30,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {44149#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; {44149#true} is VALID [2022-04-08 08:42:30,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {44149#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {44149#true} is VALID [2022-04-08 08:42:30,994 INFO L272 TraceCheckUtils]: 7: Hoare triple {44149#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {44149#true} is VALID [2022-04-08 08:42:30,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {44149#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); {44154#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:30,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {44154#(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; {44154#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:30,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {44154#(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; {44154#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:30,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {44154#(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)))); {44154#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:30,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {44154#(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); {44154#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:30,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {44154#(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; {44154#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:30,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {44154#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {44154#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:30,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {44154#(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); {44154#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:30,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {44154#(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); {44155#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-08 08:42:30,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {44155#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {44150#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {44150#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {44150#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {44150#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); {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {44150#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {44150#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); {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {44150#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); {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {44150#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); {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {44150#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {44150#false} ~skip~0 := 0; {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {44150#false} assume !false; {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {44150#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); {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {44150#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {44150#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {44150#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {44150#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {44150#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:30,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {44150#false} assume 8480 == #t~mem52;havoc #t~mem52; {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {44150#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; {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {44150#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); {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {44150#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); {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {44150#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {44150#false} ~skip~0 := 0; {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 41: Hoare triple {44150#false} assume !false; {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {44150#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); {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {44150#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 44: Hoare triple {44150#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {44150#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 46: Hoare triple {44150#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {44150#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {44150#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 49: Hoare triple {44150#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 50: Hoare triple {44150#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 51: Hoare triple {44150#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 52: Hoare triple {44150#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,000 INFO L290 TraceCheckUtils]: 53: Hoare triple {44150#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 54: Hoare triple {44150#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 55: Hoare triple {44150#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 56: Hoare triple {44150#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 57: Hoare triple {44150#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 58: Hoare triple {44150#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 59: Hoare triple {44150#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 60: Hoare triple {44150#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 61: Hoare triple {44150#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 62: Hoare triple {44150#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 63: Hoare triple {44150#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 64: Hoare triple {44150#false} assume 8448 == #t~mem68;havoc #t~mem68; {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 65: Hoare triple {44150#false} assume !(~num1~0 > 0); {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 66: Hoare triple {44150#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; {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 67: Hoare triple {44150#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); {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 68: Hoare triple {44150#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 69: Hoare triple {44150#false} ~skip~0 := 0; {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 70: Hoare triple {44150#false} assume !false; {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 71: Hoare triple {44150#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); {44150#false} is VALID [2022-04-08 08:42:31,001 INFO L290 TraceCheckUtils]: 72: Hoare triple {44150#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 73: Hoare triple {44150#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 74: Hoare triple {44150#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 75: Hoare triple {44150#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 76: Hoare triple {44150#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 77: Hoare triple {44150#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 78: Hoare triple {44150#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 79: Hoare triple {44150#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 80: Hoare triple {44150#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 81: Hoare triple {44150#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 82: Hoare triple {44150#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 83: Hoare triple {44150#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 84: Hoare triple {44150#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 85: Hoare triple {44150#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 86: Hoare triple {44150#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 87: Hoare triple {44150#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 88: Hoare triple {44150#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 89: Hoare triple {44150#false} assume 8544 == #t~mem64;havoc #t~mem64; {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 90: Hoare triple {44150#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,002 INFO L290 TraceCheckUtils]: 91: Hoare triple {44150#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,003 INFO L290 TraceCheckUtils]: 92: Hoare triple {44150#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {44150#false} is VALID [2022-04-08 08:42:31,003 INFO L290 TraceCheckUtils]: 93: Hoare triple {44150#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {44150#false} is VALID [2022-04-08 08:42:31,003 INFO L290 TraceCheckUtils]: 94: Hoare triple {44150#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {44150#false} is VALID [2022-04-08 08:42:31,003 INFO L290 TraceCheckUtils]: 95: Hoare triple {44150#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {44150#false} is VALID [2022-04-08 08:42:31,003 INFO L290 TraceCheckUtils]: 96: Hoare triple {44150#false} assume 8 == ~blastFlag~0; {44150#false} is VALID [2022-04-08 08:42:31,003 INFO L290 TraceCheckUtils]: 97: Hoare triple {44150#false} assume !false; {44150#false} is VALID [2022-04-08 08:42:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 08:42:31,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:31,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498905023] [2022-04-08 08:42:31,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498905023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:31,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:31,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:31,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:31,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1663038336] [2022-04-08 08:42:31,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1663038336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:31,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:31,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:31,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283400178] [2022-04-08 08:42:31,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:31,006 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 98 [2022-04-08 08:42:31,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:31,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:31,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:31,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:31,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:31,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:31,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:31,053 INFO L87 Difference]: Start difference. First operand 456 states and 732 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:33,534 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:36,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:37,851 INFO L93 Difference]: Finished difference Result 963 states and 1536 transitions. [2022-04-08 08:42:37,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:37,851 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 98 [2022-04-08 08:42:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-08 08:42:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-08 08:42:37,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-08 08:42:38,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:38,226 INFO L225 Difference]: With dead ends: 963 [2022-04-08 08:42:38,226 INFO L226 Difference]: Without dead ends: 533 [2022-04-08 08:42:38,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:42:38,227 INFO L913 BasicCegarLoop]: 142 mSDtfsCounter, 142 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 58 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:38,227 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 392 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 501 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-04-08 08:42:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-04-08 08:42:38,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 456. [2022-04-08 08:42:38,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:38,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 533 states. Second operand has 456 states, 451 states have (on average 1.5920177383592018) internal successors, (718), 451 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:38,249 INFO L74 IsIncluded]: Start isIncluded. First operand 533 states. Second operand has 456 states, 451 states have (on average 1.5920177383592018) internal successors, (718), 451 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:38,249 INFO L87 Difference]: Start difference. First operand 533 states. Second operand has 456 states, 451 states have (on average 1.5920177383592018) internal successors, (718), 451 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:38,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:38,259 INFO L93 Difference]: Finished difference Result 533 states and 829 transitions. [2022-04-08 08:42:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 829 transitions. [2022-04-08 08:42:38,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:38,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:38,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 456 states, 451 states have (on average 1.5920177383592018) internal successors, (718), 451 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 533 states. [2022-04-08 08:42:38,260 INFO L87 Difference]: Start difference. First operand has 456 states, 451 states have (on average 1.5920177383592018) internal successors, (718), 451 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 533 states. [2022-04-08 08:42:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:38,274 INFO L93 Difference]: Finished difference Result 533 states and 829 transitions. [2022-04-08 08:42:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 829 transitions. [2022-04-08 08:42:38,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:38,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:38,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:38,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 451 states have (on average 1.5920177383592018) internal successors, (718), 451 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 722 transitions. [2022-04-08 08:42:38,284 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 722 transitions. Word has length 98 [2022-04-08 08:42:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:38,284 INFO L478 AbstractCegarLoop]: Abstraction has 456 states and 722 transitions. [2022-04-08 08:42:38,284 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:38,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 456 states and 722 transitions. [2022-04-08 08:42:38,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 722 edges. 722 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 722 transitions. [2022-04-08 08:42:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 08:42:38,894 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:38,894 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:38,894 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:42:38,894 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:38,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:38,894 INFO L85 PathProgramCache]: Analyzing trace with hash -218330777, now seen corresponding path program 1 times [2022-04-08 08:42:38,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:38,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [851567572] [2022-04-08 08:42:38,937 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:38,937 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:38,937 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:38,937 INFO L85 PathProgramCache]: Analyzing trace with hash -218330777, now seen corresponding path program 2 times [2022-04-08 08:42:38,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:38,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563213625] [2022-04-08 08:42:38,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:38,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:39,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:39,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {48072#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48065#true} is VALID [2022-04-08 08:42:39,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {48065#true} assume true; {48065#true} is VALID [2022-04-08 08:42:39,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48065#true} {48065#true} #689#return; {48065#true} is VALID [2022-04-08 08:42:39,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {48065#true} call ULTIMATE.init(); {48072#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:42:39,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {48072#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48065#true} is VALID [2022-04-08 08:42:39,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {48065#true} assume true; {48065#true} is VALID [2022-04-08 08:42:39,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48065#true} {48065#true} #689#return; {48065#true} is VALID [2022-04-08 08:42:39,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {48065#true} call #t~ret161 := main(); {48065#true} is VALID [2022-04-08 08:42:39,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {48065#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; {48065#true} is VALID [2022-04-08 08:42:39,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {48065#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {48065#true} is VALID [2022-04-08 08:42:39,046 INFO L272 TraceCheckUtils]: 7: Hoare triple {48065#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {48065#true} is VALID [2022-04-08 08:42:39,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {48065#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); {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:39,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {48070#(not (= 8482 (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; {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:39,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {48070#(not (= 8482 (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; {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:39,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {48070#(not (= 8482 (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)))); {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:39,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {48070#(not (= 8482 (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); {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:39,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {48070#(not (= 8482 (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; {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:39,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:39,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:39,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:39,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:39,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:39,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:39,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:39,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:39,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {48070#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48071#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-08 08:42:39,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {48071#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {48066#false} is VALID [2022-04-08 08:42:39,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {48066#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {48066#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); {48066#false} is VALID [2022-04-08 08:42:39,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {48066#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48066#false} is VALID [2022-04-08 08:42:39,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {48066#false} ~skip~0 := 0; {48066#false} is VALID [2022-04-08 08:42:39,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {48066#false} assume !false; {48066#false} is VALID [2022-04-08 08:42:39,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {48066#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); {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {48066#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {48066#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {48066#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {48066#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {48066#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {48066#false} assume 8480 == #t~mem52;havoc #t~mem52; {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {48066#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; {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {48066#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); {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {48066#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); {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {48066#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {48066#false} ~skip~0 := 0; {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {48066#false} assume !false; {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {48066#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); {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {48066#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {48066#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {48066#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {48066#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 47: Hoare triple {48066#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {48066#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {48066#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 50: Hoare triple {48066#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 51: Hoare triple {48066#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 52: Hoare triple {48066#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {48066#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {48066#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {48066#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {48066#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 57: Hoare triple {48066#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 58: Hoare triple {48066#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 59: Hoare triple {48066#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 60: Hoare triple {48066#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 61: Hoare triple {48066#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 62: Hoare triple {48066#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 63: Hoare triple {48066#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 64: Hoare triple {48066#false} assume 8448 == #t~mem68;havoc #t~mem68; {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 65: Hoare triple {48066#false} assume !(~num1~0 > 0); {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 66: Hoare triple {48066#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; {48066#false} is VALID [2022-04-08 08:42:39,054 INFO L290 TraceCheckUtils]: 67: Hoare triple {48066#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); {48066#false} is VALID [2022-04-08 08:42:39,055 INFO L290 TraceCheckUtils]: 68: Hoare triple {48066#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48066#false} is VALID [2022-04-08 08:42:39,055 INFO L290 TraceCheckUtils]: 69: Hoare triple {48066#false} ~skip~0 := 0; {48066#false} is VALID [2022-04-08 08:42:39,055 INFO L290 TraceCheckUtils]: 70: Hoare triple {48066#false} assume !false; {48066#false} is VALID [2022-04-08 08:42:39,055 INFO L290 TraceCheckUtils]: 71: Hoare triple {48066#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); {48066#false} is VALID [2022-04-08 08:42:39,055 INFO L290 TraceCheckUtils]: 72: Hoare triple {48066#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 73: Hoare triple {48066#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 74: Hoare triple {48066#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 75: Hoare triple {48066#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 76: Hoare triple {48066#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 77: Hoare triple {48066#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 78: Hoare triple {48066#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 79: Hoare triple {48066#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 80: Hoare triple {48066#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 81: Hoare triple {48066#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 82: Hoare triple {48066#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 83: Hoare triple {48066#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 84: Hoare triple {48066#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 85: Hoare triple {48066#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 86: Hoare triple {48066#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 87: Hoare triple {48066#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 88: Hoare triple {48066#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 89: Hoare triple {48066#false} assume 8544 == #t~mem64;havoc #t~mem64; {48066#false} is VALID [2022-04-08 08:42:39,056 INFO L290 TraceCheckUtils]: 90: Hoare triple {48066#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,057 INFO L290 TraceCheckUtils]: 91: Hoare triple {48066#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,057 INFO L290 TraceCheckUtils]: 92: Hoare triple {48066#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {48066#false} is VALID [2022-04-08 08:42:39,057 INFO L290 TraceCheckUtils]: 93: Hoare triple {48066#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {48066#false} is VALID [2022-04-08 08:42:39,057 INFO L290 TraceCheckUtils]: 94: Hoare triple {48066#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {48066#false} is VALID [2022-04-08 08:42:39,057 INFO L290 TraceCheckUtils]: 95: Hoare triple {48066#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {48066#false} is VALID [2022-04-08 08:42:39,057 INFO L290 TraceCheckUtils]: 96: Hoare triple {48066#false} assume 8 == ~blastFlag~0; {48066#false} is VALID [2022-04-08 08:42:39,057 INFO L290 TraceCheckUtils]: 97: Hoare triple {48066#false} assume !false; {48066#false} is VALID [2022-04-08 08:42:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 08:42:39,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:39,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563213625] [2022-04-08 08:42:39,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563213625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:39,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:39,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:39,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:39,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [851567572] [2022-04-08 08:42:39,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [851567572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:39,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:39,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:39,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443059287] [2022-04-08 08:42:39,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:39,059 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 98 [2022-04-08 08:42:39,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:39,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:39,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:39,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:39,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:39,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:39,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:39,098 INFO L87 Difference]: Start difference. First operand 456 states and 722 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:41,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:43,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:45,990 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:47,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:47,124 INFO L93 Difference]: Finished difference Result 962 states and 1516 transitions. [2022-04-08 08:42:47,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:47,124 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 98 [2022-04-08 08:42:47,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-08 08:42:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-08 08:42:47,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-08 08:42:47,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:47,489 INFO L225 Difference]: With dead ends: 962 [2022-04-08 08:42:47,490 INFO L226 Difference]: Without dead ends: 532 [2022-04-08 08:42:47,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:42:47,490 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 135 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:47,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 394 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 499 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-04-08 08:42:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-04-08 08:42:47,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 456. [2022-04-08 08:42:47,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:47,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 532 states. Second operand has 456 states, 451 states have (on average 1.5698447893569845) internal successors, (708), 451 states have internal predecessors, (708), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:47,519 INFO L74 IsIncluded]: Start isIncluded. First operand 532 states. Second operand has 456 states, 451 states have (on average 1.5698447893569845) internal successors, (708), 451 states have internal predecessors, (708), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:47,519 INFO L87 Difference]: Start difference. First operand 532 states. Second operand has 456 states, 451 states have (on average 1.5698447893569845) internal successors, (708), 451 states have internal predecessors, (708), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:47,529 INFO L93 Difference]: Finished difference Result 532 states and 818 transitions. [2022-04-08 08:42:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 818 transitions. [2022-04-08 08:42:47,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:47,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:47,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 456 states, 451 states have (on average 1.5698447893569845) internal successors, (708), 451 states have internal predecessors, (708), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 532 states. [2022-04-08 08:42:47,530 INFO L87 Difference]: Start difference. First operand has 456 states, 451 states have (on average 1.5698447893569845) internal successors, (708), 451 states have internal predecessors, (708), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 532 states. [2022-04-08 08:42:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:47,539 INFO L93 Difference]: Finished difference Result 532 states and 818 transitions. [2022-04-08 08:42:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 818 transitions. [2022-04-08 08:42:47,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:47,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:47,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:47,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 451 states have (on average 1.5698447893569845) internal successors, (708), 451 states have internal predecessors, (708), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 712 transitions. [2022-04-08 08:42:47,550 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 712 transitions. Word has length 98 [2022-04-08 08:42:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:47,550 INFO L478 AbstractCegarLoop]: Abstraction has 456 states and 712 transitions. [2022-04-08 08:42:47,550 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:47,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 456 states and 712 transitions. [2022-04-08 08:42:48,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 712 edges. 712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 712 transitions. [2022-04-08 08:42:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 08:42:48,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:48,206 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-04-08 08:42:48,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:42:48,206 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:48,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:48,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1597835116, now seen corresponding path program 1 times [2022-04-08 08:42:48,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:48,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1190843601] [2022-04-08 08:42:48,383 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:42:48,384 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:48,384 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:48,385 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:48,385 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:48,386 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:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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-08 08:42:48,389 INFO L158 Benchmark]: Toolchain (without parser) took 142545.92ms. Allocated memory was 189.8MB in the beginning and 232.8MB in the end (delta: 43.0MB). Free memory was 136.8MB in the beginning and 84.9MB in the end (delta: 51.9MB). Peak memory consumption was 94.5MB. Max. memory is 8.0GB. [2022-04-08 08:42:48,389 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory was 155.4MB in the beginning and 155.3MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:42:48,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.70ms. Allocated memory is still 189.8MB. Free memory was 136.7MB in the beginning and 141.2MB in the end (delta: -4.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 08:42:48,390 INFO L158 Benchmark]: Boogie Preprocessor took 118.62ms. Allocated memory is still 189.8MB. Free memory was 141.2MB in the beginning and 131.2MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 08:42:48,390 INFO L158 Benchmark]: RCFGBuilder took 1392.59ms. Allocated memory was 189.8MB in the beginning and 232.8MB in the end (delta: 43.0MB). Free memory was 131.2MB in the beginning and 150.8MB in the end (delta: -19.6MB). Peak memory consumption was 43.4MB. Max. memory is 8.0GB. [2022-04-08 08:42:48,390 INFO L158 Benchmark]: TraceAbstraction took 140518.76ms. Allocated memory is still 232.8MB. Free memory was 150.3MB in the beginning and 85.5MB in the end (delta: 64.8MB). Peak memory consumption was 64.8MB. Max. memory is 8.0GB. [2022-04-08 08:42:48,391 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory was 155.4MB in the beginning and 155.3MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 511.70ms. Allocated memory is still 189.8MB. Free memory was 136.7MB in the beginning and 141.2MB in the end (delta: -4.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 118.62ms. Allocated memory is still 189.8MB. Free memory was 141.2MB in the beginning and 131.2MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1392.59ms. Allocated memory was 189.8MB in the beginning and 232.8MB in the end (delta: 43.0MB). Free memory was 131.2MB in the beginning and 150.8MB in the end (delta: -19.6MB). Peak memory consumption was 43.4MB. Max. memory is 8.0GB. * TraceAbstraction took 140518.76ms. Allocated memory is still 232.8MB. Free memory was 150.3MB in the beginning and 85.5MB in the end (delta: 64.8MB). Peak memory consumption was 64.8MB. 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-08 08:42:48,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...