/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:25:09,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:25:09,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:25:09,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:25:09,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:25:09,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:25:09,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:25:09,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:25:09,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:25:09,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:25:09,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:25:09,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:25:09,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:25:09,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:25:09,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:25:09,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:25:09,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:25:09,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:25:09,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:25:09,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:25:09,253 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:25:09,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:25:09,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:25:09,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:25:09,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:25:09,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:25:09,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:25:09,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:25:09,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:25:09,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:25:09,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:25:09,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:25:09,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:25:09,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:25:09,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:25:09,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:25:09,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:25:09,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:25:09,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:25:09,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:25:09,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:25:09,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:25:09,268 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:25:09,294 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:25:09,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:25:09,294 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:25:09,294 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:25:09,295 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:25:09,295 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:25:09,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:25:09,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:25:09,295 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:25:09,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:25:09,296 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:25:09,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:25:09,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:25:09,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:25:09,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:25:09,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:25:09,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:25:09,297 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:25:09,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:25:09,297 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:25:09,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:25:09,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:25:09,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:25:09,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:25:09,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:25:09,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:25:09,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:25:09,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:25:09,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:25:09,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:25:09,298 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:25:09,298 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:25:09,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:25:09,298 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 15:25:09,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:25:09,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:25:09,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:25:09,515 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:25:09,520 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:25:09,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-04-27 15:25:09,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876634528/ab009bbd69d2480db12a43664a693f3e/FLAG6ce6edfe6 [2022-04-27 15:25:10,024 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:25:10,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-04-27 15:25:10,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876634528/ab009bbd69d2480db12a43664a693f3e/FLAG6ce6edfe6 [2022-04-27 15:25:10,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876634528/ab009bbd69d2480db12a43664a693f3e [2022-04-27 15:25:10,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:25:10,371 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:25:10,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:25:10,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:25:10,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:25:10,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:25:10" (1/1) ... [2022-04-27 15:25:10,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34341b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:10, skipping insertion in model container [2022-04-27 15:25:10,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:25:10" (1/1) ... [2022-04-27 15:25:10,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:25:10,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:25:10,790 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.01.i.cil-2.c[72913,72926] [2022-04-27 15:25:10,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:25:10,814 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:25:10,909 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.01.i.cil-2.c[72913,72926] [2022-04-27 15:25:10,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:25:10,934 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:25:10,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:10 WrapperNode [2022-04-27 15:25:10,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:25:10,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:25:10,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:25:10,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:25:10,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:10" (1/1) ... [2022-04-27 15:25:10,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:10" (1/1) ... [2022-04-27 15:25:10,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:10" (1/1) ... [2022-04-27 15:25:10,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:10" (1/1) ... [2022-04-27 15:25:11,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:10" (1/1) ... [2022-04-27 15:25:11,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:10" (1/1) ... [2022-04-27 15:25:11,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:10" (1/1) ... [2022-04-27 15:25:11,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:25:11,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:25:11,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:25:11,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:25:11,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:10" (1/1) ... [2022-04-27 15:25:11,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:25:11,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:25:11,073 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-27 15:25:11,105 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-27 15:25:11,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:25:11,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:25:11,120 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:25:11,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-27 15:25:11,122 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-27 15:25:11,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:25:11,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-27 15:25:11,122 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-27 15:25:11,122 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 15:25:11,123 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-27 15:25:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:25:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:25:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:25:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:25:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-27 15:25:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 15:25:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:25:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-27 15:25:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-27 15:25:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-27 15:25:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-27 15:25:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-27 15:25:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-27 15:25:11,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-27 15:25:11,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:25:11,274 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:25:11,275 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:25:13,566 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-27 15:25:14,047 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-27 15:25:14,047 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-27 15:25:14,058 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:25:14,065 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:25:14,065 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:25:14,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:25:14 BoogieIcfgContainer [2022-04-27 15:25:14,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:25:14,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:25:14,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:25:14,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:25:14,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:25:10" (1/3) ... [2022-04-27 15:25:14,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f641ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:25:14, skipping insertion in model container [2022-04-27 15:25:14,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:10" (2/3) ... [2022-04-27 15:25:14,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f641ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:25:14, skipping insertion in model container [2022-04-27 15:25:14,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:25:14" (3/3) ... [2022-04-27 15:25:14,072 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-04-27 15:25:14,081 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:25:14,081 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:25:14,112 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:25:14,116 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@549862f1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@e7ca678 [2022-04-27 15:25:14,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:25:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 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-27 15:25:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 15:25:14,129 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:14,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:14,130 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:14,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:14,133 INFO L85 PathProgramCache]: Analyzing trace with hash 740864289, now seen corresponding path program 1 times [2022-04-27 15:25:14,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:14,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407695107] [2022-04-27 15:25:14,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:14,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:14,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:14,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {158#true} is VALID [2022-04-27 15:25:14,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-27 15:25:14,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} #664#return; {158#true} is VALID [2022-04-27 15:25:14,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} call ULTIMATE.init(); {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:25:14,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {158#true} is VALID [2022-04-27 15:25:14,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-27 15:25:14,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} #664#return; {158#true} is VALID [2022-04-27 15:25:14,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} call #t~ret162 := main(); {158#true} is VALID [2022-04-27 15:25:14,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {158#true} is VALID [2022-04-27 15:25:14,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {158#true} is VALID [2022-04-27 15:25:14,536 INFO L272 TraceCheckUtils]: 7: Hoare triple {158#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {158#true} is VALID [2022-04-27 15:25:14,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {163#(= 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)))); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:14,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {164#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-27 15:25:14,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {164#(= 8464 |ssl3_accept_#t~mem50|)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {159#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {159#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {159#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {159#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {159#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {159#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {159#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {159#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {159#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {159#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,602 INFO L290 TraceCheckUtils]: 35: Hoare triple {159#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {159#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {159#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,603 INFO L290 TraceCheckUtils]: 38: Hoare triple {159#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {159#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {159#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,604 INFO L290 TraceCheckUtils]: 41: Hoare triple {159#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {159#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,604 INFO L290 TraceCheckUtils]: 43: Hoare triple {159#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {159#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {159#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,608 INFO L290 TraceCheckUtils]: 46: Hoare triple {159#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {159#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-27 15:25:14,610 INFO L290 TraceCheckUtils]: 48: Hoare triple {159#false} assume 8672 == #t~mem74;havoc #t~mem74; {159#false} is VALID [2022-04-27 15:25:14,611 INFO L290 TraceCheckUtils]: 49: Hoare triple {159#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {159#false} is VALID [2022-04-27 15:25:14,615 INFO L290 TraceCheckUtils]: 50: Hoare triple {159#false} assume 4 == ~blastFlag~0; {159#false} is VALID [2022-04-27 15:25:14,615 INFO L290 TraceCheckUtils]: 51: Hoare triple {159#false} assume !false; {159#false} is VALID [2022-04-27 15:25:14,617 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-27 15:25:14,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:14,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407695107] [2022-04-27 15:25:14,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407695107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:14,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:14,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:14,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238324422] [2022-04-27 15:25:14,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:14,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-27 15:25:14,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:14,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:14,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:14,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:14,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:14,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:14,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:14,717 INFO L87 Difference]: Start difference. First operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:16,769 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-27 15:25:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:17,964 INFO L93 Difference]: Finished difference Result 328 states and 543 transitions. [2022-04-27 15:25:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:17,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-27 15:25:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-27 15:25:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-27 15:25:17,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 543 transitions. [2022-04-27 15:25:18,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 543 edges. 543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:18,416 INFO L225 Difference]: With dead ends: 328 [2022-04-27 15:25:18,416 INFO L226 Difference]: Without dead ends: 167 [2022-04-27 15:25:18,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:18,420 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 33 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:18,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 583 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:25:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-27 15:25:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2022-04-27 15:25:18,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:18,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:18,449 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:18,450 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:18,456 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-27 15:25:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-27 15:25:18,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:18,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:18,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-27 15:25:18,464 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-27 15:25:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:18,472 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-27 15:25:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-27 15:25:18,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:18,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:18,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:18,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2022-04-27 15:25:18,482 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 52 [2022-04-27 15:25:18,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:18,483 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2022-04-27 15:25:18,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2022-04-27 15:25:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 15:25:18,484 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:18,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:18,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:25:18,485 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:18,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:18,485 INFO L85 PathProgramCache]: Analyzing trace with hash -444444622, now seen corresponding path program 1 times [2022-04-27 15:25:18,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:18,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733762554] [2022-04-27 15:25:18,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:18,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:18,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:18,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {1084#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {1077#true} is VALID [2022-04-27 15:25:18,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {1077#true} assume true; {1077#true} is VALID [2022-04-27 15:25:18,629 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1077#true} {1077#true} #664#return; {1077#true} is VALID [2022-04-27 15:25:18,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {1077#true} call ULTIMATE.init(); {1084#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:25:18,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {1084#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {1077#true} is VALID [2022-04-27 15:25:18,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {1077#true} assume true; {1077#true} is VALID [2022-04-27 15:25:18,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1077#true} {1077#true} #664#return; {1077#true} is VALID [2022-04-27 15:25:18,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {1077#true} call #t~ret162 := main(); {1077#true} is VALID [2022-04-27 15:25:18,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {1077#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {1077#true} is VALID [2022-04-27 15:25:18,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {1077#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1077#true} is VALID [2022-04-27 15:25:18,631 INFO L272 TraceCheckUtils]: 7: Hoare triple {1077#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1077#true} is VALID [2022-04-27 15:25:18,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {1077#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:18,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:18,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:18,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {1082#(not (= 8480 (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)))); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:18,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:18,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:18,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:18,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:18,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:18,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:18,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:18,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:18,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1083#(not (= |ssl3_accept_#t~mem47| 8480))} is VALID [2022-04-27 15:25:18,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {1083#(not (= |ssl3_accept_#t~mem47| 8480))} assume 8480 == #t~mem47;havoc #t~mem47; {1078#false} is VALID [2022-04-27 15:25:18,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {1078#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {1078#false} is VALID [2022-04-27 15:25:18,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {1078#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem88.base, 844 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {1078#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {1078#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {1078#false} is VALID [2022-04-27 15:25:18,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {1078#false} ~skip~0 := 0; {1078#false} is VALID [2022-04-27 15:25:18,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {1078#false} assume !false; {1078#false} is VALID [2022-04-27 15:25:18,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {1078#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {1078#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {1078#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {1078#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {1078#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {1078#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {1078#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {1078#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {1078#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {1078#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,640 INFO L290 TraceCheckUtils]: 38: Hoare triple {1078#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,640 INFO L290 TraceCheckUtils]: 39: Hoare triple {1078#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,640 INFO L290 TraceCheckUtils]: 40: Hoare triple {1078#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {1078#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {1078#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {1078#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,641 INFO L290 TraceCheckUtils]: 44: Hoare triple {1078#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,641 INFO L290 TraceCheckUtils]: 45: Hoare triple {1078#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {1078#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {1078#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,641 INFO L290 TraceCheckUtils]: 48: Hoare triple {1078#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,641 INFO L290 TraceCheckUtils]: 49: Hoare triple {1078#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {1078#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {1078#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,641 INFO L290 TraceCheckUtils]: 52: Hoare triple {1078#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,642 INFO L290 TraceCheckUtils]: 53: Hoare triple {1078#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,642 INFO L290 TraceCheckUtils]: 54: Hoare triple {1078#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,642 INFO L290 TraceCheckUtils]: 55: Hoare triple {1078#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,642 INFO L290 TraceCheckUtils]: 56: Hoare triple {1078#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,642 INFO L290 TraceCheckUtils]: 57: Hoare triple {1078#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,642 INFO L290 TraceCheckUtils]: 58: Hoare triple {1078#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,642 INFO L290 TraceCheckUtils]: 59: Hoare triple {1078#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,642 INFO L290 TraceCheckUtils]: 60: Hoare triple {1078#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-27 15:25:18,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {1078#false} assume 8672 == #t~mem74;havoc #t~mem74; {1078#false} is VALID [2022-04-27 15:25:18,643 INFO L290 TraceCheckUtils]: 62: Hoare triple {1078#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {1078#false} is VALID [2022-04-27 15:25:18,643 INFO L290 TraceCheckUtils]: 63: Hoare triple {1078#false} assume 4 == ~blastFlag~0; {1078#false} is VALID [2022-04-27 15:25:18,643 INFO L290 TraceCheckUtils]: 64: Hoare triple {1078#false} assume !false; {1078#false} is VALID [2022-04-27 15:25:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:25:18,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:18,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733762554] [2022-04-27 15:25:18,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733762554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:18,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:18,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:18,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140982866] [2022-04-27 15:25:18,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:18,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-27 15:25:18,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:18,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:18,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:18,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:18,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:18,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:18,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:18,694 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:20,717 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-27 15:25:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:21,872 INFO L93 Difference]: Finished difference Result 390 states and 595 transitions. [2022-04-27 15:25:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:21,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-27 15:25:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-27 15:25:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-27 15:25:21,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-27 15:25:22,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:22,318 INFO L225 Difference]: With dead ends: 390 [2022-04-27 15:25:22,319 INFO L226 Difference]: Without dead ends: 266 [2022-04-27 15:25:22,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:22,321 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 140 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:22,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 321 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:25:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-04-27 15:25:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 166. [2022-04-27 15:25:22,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:22,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand has 166 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:22,329 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand has 166 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:22,330 INFO L87 Difference]: Start difference. First operand 266 states. Second operand has 166 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:22,336 INFO L93 Difference]: Finished difference Result 266 states and 404 transitions. [2022-04-27 15:25:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 404 transitions. [2022-04-27 15:25:22,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:22,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:22,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 266 states. [2022-04-27 15:25:22,337 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 266 states. [2022-04-27 15:25:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:22,344 INFO L93 Difference]: Finished difference Result 266 states and 404 transitions. [2022-04-27 15:25:22,344 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 404 transitions. [2022-04-27 15:25:22,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:22,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:22,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:22,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 252 transitions. [2022-04-27 15:25:22,349 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 252 transitions. Word has length 65 [2022-04-27 15:25:22,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:22,349 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 252 transitions. [2022-04-27 15:25:22,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 252 transitions. [2022-04-27 15:25:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 15:25:22,350 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:22,350 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:22,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:25:22,350 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:22,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:22,351 INFO L85 PathProgramCache]: Analyzing trace with hash 795477037, now seen corresponding path program 1 times [2022-04-27 15:25:22,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:22,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46068893] [2022-04-27 15:25:22,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:22,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:22,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:22,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {2292#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {2285#true} is VALID [2022-04-27 15:25:22,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-27 15:25:22,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2285#true} {2285#true} #664#return; {2285#true} is VALID [2022-04-27 15:25:22,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {2285#true} call ULTIMATE.init(); {2292#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:25:22,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {2292#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {2285#true} is VALID [2022-04-27 15:25:22,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-27 15:25:22,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#true} {2285#true} #664#return; {2285#true} is VALID [2022-04-27 15:25:22,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {2285#true} call #t~ret162 := main(); {2285#true} is VALID [2022-04-27 15:25:22,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {2285#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {2285#true} is VALID [2022-04-27 15:25:22,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {2285#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2285#true} is VALID [2022-04-27 15:25:22,473 INFO L272 TraceCheckUtils]: 7: Hoare triple {2285#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2285#true} is VALID [2022-04-27 15:25:22,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {2285#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:22,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:22,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:22,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {2290#(= 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)))); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:22,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:22,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:22,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:22,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:22,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:22,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:22,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:22,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:22,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:22,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2291#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-27 15:25:22,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {2291#(= 8464 |ssl3_accept_#t~mem48|)} assume 8481 == #t~mem48;havoc #t~mem48; {2286#false} is VALID [2022-04-27 15:25:22,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {2286#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {2286#false} is VALID [2022-04-27 15:25:22,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {2286#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem88.base, 844 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {2286#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {2286#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {2286#false} is VALID [2022-04-27 15:25:22,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {2286#false} ~skip~0 := 0; {2286#false} is VALID [2022-04-27 15:25:22,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-27 15:25:22,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {2286#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {2286#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {2286#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {2286#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {2286#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {2286#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {2286#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {2286#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {2286#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {2286#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {2286#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {2286#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {2286#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {2286#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {2286#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {2286#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,483 INFO L290 TraceCheckUtils]: 46: Hoare triple {2286#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {2286#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {2286#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {2286#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,483 INFO L290 TraceCheckUtils]: 50: Hoare triple {2286#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,483 INFO L290 TraceCheckUtils]: 51: Hoare triple {2286#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,483 INFO L290 TraceCheckUtils]: 52: Hoare triple {2286#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,484 INFO L290 TraceCheckUtils]: 53: Hoare triple {2286#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,484 INFO L290 TraceCheckUtils]: 54: Hoare triple {2286#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,484 INFO L290 TraceCheckUtils]: 55: Hoare triple {2286#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,484 INFO L290 TraceCheckUtils]: 56: Hoare triple {2286#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,484 INFO L290 TraceCheckUtils]: 57: Hoare triple {2286#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,484 INFO L290 TraceCheckUtils]: 58: Hoare triple {2286#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,484 INFO L290 TraceCheckUtils]: 59: Hoare triple {2286#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {2286#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {2286#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-27 15:25:22,484 INFO L290 TraceCheckUtils]: 62: Hoare triple {2286#false} assume 8672 == #t~mem74;havoc #t~mem74; {2286#false} is VALID [2022-04-27 15:25:22,484 INFO L290 TraceCheckUtils]: 63: Hoare triple {2286#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {2286#false} is VALID [2022-04-27 15:25:22,485 INFO L290 TraceCheckUtils]: 64: Hoare triple {2286#false} assume 4 == ~blastFlag~0; {2286#false} is VALID [2022-04-27 15:25:22,485 INFO L290 TraceCheckUtils]: 65: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-27 15:25:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:25:22,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:22,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46068893] [2022-04-27 15:25:22,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46068893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:22,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:22,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:22,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389256434] [2022-04-27 15:25:22,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:22,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-27 15:25:22,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:22,486 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-27 15:25:22,528 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-27 15:25:22,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:22,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:22,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:22,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:22,529 INFO L87 Difference]: Start difference. First operand 166 states and 252 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-27 15:25:24,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:25,507 INFO L93 Difference]: Finished difference Result 321 states and 486 transitions. [2022-04-27 15:25:25,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:25,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-27 15:25:25,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:25,508 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-27 15:25:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-27 15:25:25,511 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-27 15:25:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-27 15:25:25,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-27 15:25:25,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:25,796 INFO L225 Difference]: With dead ends: 321 [2022-04-27 15:25:25,796 INFO L226 Difference]: Without dead ends: 181 [2022-04-27 15:25:25,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:25,798 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 22 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:25,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 466 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:25:25,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-27 15:25:25,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 166. [2022-04-27 15:25:25,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:25,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 161 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:25,806 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 161 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:25,806 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 161 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:25,810 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2022-04-27 15:25:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2022-04-27 15:25:25,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:25,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:25,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 161 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 181 states. [2022-04-27 15:25:25,811 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 161 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 181 states. [2022-04-27 15:25:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:25,814 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2022-04-27 15:25:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2022-04-27 15:25:25,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:25,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:25,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:25,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 161 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 251 transitions. [2022-04-27 15:25:25,835 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 251 transitions. Word has length 66 [2022-04-27 15:25:25,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:25,835 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 251 transitions. [2022-04-27 15:25:25,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 251 transitions. [2022-04-27 15:25:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 15:25:25,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:25,836 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:25,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:25:25,836 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:25,836 INFO L85 PathProgramCache]: Analyzing trace with hash -498657998, now seen corresponding path program 1 times [2022-04-27 15:25:25,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:25,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50697118] [2022-04-27 15:25:25,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:25,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:25,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {3246#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {3239#true} is VALID [2022-04-27 15:25:25,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {3239#true} assume true; {3239#true} is VALID [2022-04-27 15:25:25,935 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3239#true} {3239#true} #664#return; {3239#true} is VALID [2022-04-27 15:25:25,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {3239#true} call ULTIMATE.init(); {3246#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:25:25,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {3246#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {3239#true} is VALID [2022-04-27 15:25:25,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {3239#true} assume true; {3239#true} is VALID [2022-04-27 15:25:25,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3239#true} {3239#true} #664#return; {3239#true} is VALID [2022-04-27 15:25:25,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {3239#true} call #t~ret162 := main(); {3239#true} is VALID [2022-04-27 15:25:25,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {3239#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {3239#true} is VALID [2022-04-27 15:25:25,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {3239#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3239#true} is VALID [2022-04-27 15:25:25,939 INFO L272 TraceCheckUtils]: 7: Hoare triple {3239#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3239#true} is VALID [2022-04-27 15:25:25,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {3239#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:25,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:25,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:25,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {3244#(= 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)))); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:25,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:25,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:25,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:25,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:25,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:25,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:25,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:25,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:25,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:25,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:25,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3245#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-27 15:25:25,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {3245#(= 8464 |ssl3_accept_#t~mem49|)} assume 8482 == #t~mem49;havoc #t~mem49; {3240#false} is VALID [2022-04-27 15:25:25,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {3240#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {3240#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {3240#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {3240#false} is VALID [2022-04-27 15:25:25,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {3240#false} ~skip~0 := 0; {3240#false} is VALID [2022-04-27 15:25:25,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {3240#false} assume !false; {3240#false} is VALID [2022-04-27 15:25:25,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {3240#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {3240#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {3240#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {3240#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {3240#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {3240#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {3240#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {3240#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {3240#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,949 INFO L290 TraceCheckUtils]: 38: Hoare triple {3240#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {3240#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {3240#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {3240#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {3240#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {3240#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {3240#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {3240#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {3240#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {3240#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {3240#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {3240#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {3240#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,952 INFO L290 TraceCheckUtils]: 51: Hoare triple {3240#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,953 INFO L290 TraceCheckUtils]: 52: Hoare triple {3240#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,958 INFO L290 TraceCheckUtils]: 53: Hoare triple {3240#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {3240#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,958 INFO L290 TraceCheckUtils]: 55: Hoare triple {3240#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {3240#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,959 INFO L290 TraceCheckUtils]: 57: Hoare triple {3240#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,959 INFO L290 TraceCheckUtils]: 58: Hoare triple {3240#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,959 INFO L290 TraceCheckUtils]: 59: Hoare triple {3240#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,959 INFO L290 TraceCheckUtils]: 60: Hoare triple {3240#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,959 INFO L290 TraceCheckUtils]: 61: Hoare triple {3240#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-27 15:25:25,959 INFO L290 TraceCheckUtils]: 62: Hoare triple {3240#false} assume 8672 == #t~mem74;havoc #t~mem74; {3240#false} is VALID [2022-04-27 15:25:25,959 INFO L290 TraceCheckUtils]: 63: Hoare triple {3240#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {3240#false} is VALID [2022-04-27 15:25:25,959 INFO L290 TraceCheckUtils]: 64: Hoare triple {3240#false} assume 4 == ~blastFlag~0; {3240#false} is VALID [2022-04-27 15:25:25,959 INFO L290 TraceCheckUtils]: 65: Hoare triple {3240#false} assume !false; {3240#false} is VALID [2022-04-27 15:25:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:25:25,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:25,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50697118] [2022-04-27 15:25:25,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50697118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:25,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:25,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:25,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469532877] [2022-04-27 15:25:25,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:25,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-27 15:25:25,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:25,961 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-27 15:25:26,008 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-27 15:25:26,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:26,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:26,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:26,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:26,009 INFO L87 Difference]: Start difference. First operand 166 states and 251 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-27 15:25:28,030 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-27 15:25:28,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:28,933 INFO L93 Difference]: Finished difference Result 320 states and 484 transitions. [2022-04-27 15:25:28,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:28,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-27 15:25:28,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:28,934 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-27 15:25:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-27 15:25:28,942 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-27 15:25:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-27 15:25:28,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 432 transitions. [2022-04-27 15:25:29,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:29,234 INFO L225 Difference]: With dead ends: 320 [2022-04-27 15:25:29,234 INFO L226 Difference]: Without dead ends: 180 [2022-04-27 15:25:29,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:29,235 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 20 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:29,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 468 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 347 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:25:29,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-27 15:25:29,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 166. [2022-04-27 15:25:29,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:29,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 166 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 161 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:29,241 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 166 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 161 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:29,242 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 166 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 161 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:29,245 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-27 15:25:29,245 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-27 15:25:29,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:29,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:29,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 161 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-27 15:25:29,246 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 161 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-27 15:25:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:29,249 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-27 15:25:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-27 15:25:29,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:29,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:29,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:29,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 161 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 250 transitions. [2022-04-27 15:25:29,252 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 250 transitions. Word has length 66 [2022-04-27 15:25:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:29,252 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 250 transitions. [2022-04-27 15:25:29,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 250 transitions. [2022-04-27 15:25:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-27 15:25:29,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:29,253 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:29,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:25:29,253 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:29,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:29,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2086075870, now seen corresponding path program 1 times [2022-04-27 15:25:29,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:29,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763653364] [2022-04-27 15:25:29,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:29,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:29,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:29,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {4196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {4189#true} is VALID [2022-04-27 15:25:29,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {4189#true} assume true; {4189#true} is VALID [2022-04-27 15:25:29,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4189#true} {4189#true} #664#return; {4189#true} is VALID [2022-04-27 15:25:29,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {4189#true} call ULTIMATE.init(); {4196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:25:29,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {4196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {4189#true} is VALID [2022-04-27 15:25:29,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {4189#true} assume true; {4189#true} is VALID [2022-04-27 15:25:29,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4189#true} {4189#true} #664#return; {4189#true} is VALID [2022-04-27 15:25:29,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {4189#true} call #t~ret162 := main(); {4189#true} is VALID [2022-04-27 15:25:29,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {4189#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {4189#true} is VALID [2022-04-27 15:25:29,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {4189#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4189#true} is VALID [2022-04-27 15:25:29,374 INFO L272 TraceCheckUtils]: 7: Hoare triple {4189#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4189#true} is VALID [2022-04-27 15:25:29,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {4189#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:29,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:29,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:29,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {4194#(= 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)))); {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:29,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:29,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:29,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:29,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {4195#(= 8464 |ssl3_accept_#t~mem42|)} is VALID [2022-04-27 15:25:29,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {4195#(= 8464 |ssl3_accept_#t~mem42|)} assume 12292 == #t~mem42;havoc #t~mem42; {4190#false} is VALID [2022-04-27 15:25:29,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {4190#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {4190#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4190#false} is VALID [2022-04-27 15:25:29,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {4190#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {4190#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {4190#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {4190#false} is VALID [2022-04-27 15:25:29,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {4190#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {4190#false} is VALID [2022-04-27 15:25:29,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {4190#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {4190#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {4190#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {4190#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {4190#false} is VALID [2022-04-27 15:25:29,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {4190#false} ~skip~0 := 0; {4190#false} is VALID [2022-04-27 15:25:29,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {4190#false} assume !false; {4190#false} is VALID [2022-04-27 15:25:29,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {4190#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {4190#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {4190#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {4190#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {4190#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {4190#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {4190#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {4190#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {4190#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {4190#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {4190#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {4190#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,382 INFO L290 TraceCheckUtils]: 42: Hoare triple {4190#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {4190#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {4190#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {4190#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {4190#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {4190#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {4190#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {4190#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {4190#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {4190#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 52: Hoare triple {4190#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 53: Hoare triple {4190#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 54: Hoare triple {4190#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 55: Hoare triple {4190#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 56: Hoare triple {4190#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 57: Hoare triple {4190#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {4190#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {4190#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 60: Hoare triple {4190#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {4190#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,384 INFO L290 TraceCheckUtils]: 62: Hoare triple {4190#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-27 15:25:29,384 INFO L290 TraceCheckUtils]: 63: Hoare triple {4190#false} assume 8672 == #t~mem74;havoc #t~mem74; {4190#false} is VALID [2022-04-27 15:25:29,384 INFO L290 TraceCheckUtils]: 64: Hoare triple {4190#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {4190#false} is VALID [2022-04-27 15:25:29,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {4190#false} assume 4 == ~blastFlag~0; {4190#false} is VALID [2022-04-27 15:25:29,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {4190#false} assume !false; {4190#false} is VALID [2022-04-27 15:25:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:25:29,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:29,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763653364] [2022-04-27 15:25:29,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763653364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:29,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:29,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:29,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973090212] [2022-04-27 15:25:29,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:29,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-27 15:25:29,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:29,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:29,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:29,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:29,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:29,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:29,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:29,437 INFO L87 Difference]: Start difference. First operand 166 states and 250 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:31,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:32,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:32,338 INFO L93 Difference]: Finished difference Result 319 states and 482 transitions. [2022-04-27 15:25:32,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:32,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-27 15:25:32,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:32,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-27 15:25:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-27 15:25:32,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 430 transitions. [2022-04-27 15:25:32,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:32,624 INFO L225 Difference]: With dead ends: 319 [2022-04-27 15:25:32,624 INFO L226 Difference]: Without dead ends: 179 [2022-04-27 15:25:32,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:32,625 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 26 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:32,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:25:32,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-27 15:25:32,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2022-04-27 15:25:32,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:32,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 166 states, 161 states have (on average 1.5217391304347827) internal successors, (245), 161 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:32,632 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 166 states, 161 states have (on average 1.5217391304347827) internal successors, (245), 161 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:32,632 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 166 states, 161 states have (on average 1.5217391304347827) internal successors, (245), 161 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:32,635 INFO L93 Difference]: Finished difference Result 179 states and 266 transitions. [2022-04-27 15:25:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 266 transitions. [2022-04-27 15:25:32,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:32,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:32,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.5217391304347827) internal successors, (245), 161 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 179 states. [2022-04-27 15:25:32,636 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.5217391304347827) internal successors, (245), 161 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 179 states. [2022-04-27 15:25:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:32,638 INFO L93 Difference]: Finished difference Result 179 states and 266 transitions. [2022-04-27 15:25:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 266 transitions. [2022-04-27 15:25:32,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:32,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:32,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:32,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.5217391304347827) internal successors, (245), 161 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 249 transitions. [2022-04-27 15:25:32,641 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 249 transitions. Word has length 67 [2022-04-27 15:25:32,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:32,641 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 249 transitions. [2022-04-27 15:25:32,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:32,641 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 249 transitions. [2022-04-27 15:25:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-27 15:25:32,642 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:32,642 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:32,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:25:32,642 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:32,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:32,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1877545714, now seen corresponding path program 1 times [2022-04-27 15:25:32,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:32,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630653575] [2022-04-27 15:25:32,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:32,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:32,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:32,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {5142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {5135#true} is VALID [2022-04-27 15:25:32,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {5135#true} assume true; {5135#true} is VALID [2022-04-27 15:25:32,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5135#true} {5135#true} #664#return; {5135#true} is VALID [2022-04-27 15:25:32,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {5135#true} call ULTIMATE.init(); {5142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:25:32,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {5142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {5135#true} is VALID [2022-04-27 15:25:32,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {5135#true} assume true; {5135#true} is VALID [2022-04-27 15:25:32,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5135#true} {5135#true} #664#return; {5135#true} is VALID [2022-04-27 15:25:32,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {5135#true} call #t~ret162 := main(); {5135#true} is VALID [2022-04-27 15:25:32,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {5135#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {5135#true} is VALID [2022-04-27 15:25:32,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {5135#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5135#true} is VALID [2022-04-27 15:25:32,739 INFO L272 TraceCheckUtils]: 7: Hoare triple {5135#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5135#true} is VALID [2022-04-27 15:25:32,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {5135#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:32,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:32,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:32,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {5140#(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)))); {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:32,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:32,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:32,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:32,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:32,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {5141#(not (= |ssl3_accept_#t~mem43| 16384))} is VALID [2022-04-27 15:25:32,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {5141#(not (= |ssl3_accept_#t~mem43| 16384))} assume 16384 == #t~mem43;havoc #t~mem43; {5136#false} is VALID [2022-04-27 15:25:32,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {5136#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {5136#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {5136#false} is VALID [2022-04-27 15:25:32,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {5136#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {5136#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {5136#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {5136#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {5136#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {5136#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {5136#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {5136#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {5136#false} ~skip~0 := 0; {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {5136#false} assume !false; {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {5136#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {5136#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {5136#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {5136#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {5136#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {5136#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {5136#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {5136#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {5136#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {5136#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {5136#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {5136#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {5136#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {5136#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {5136#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {5136#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {5136#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {5136#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {5136#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {5136#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {5136#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {5136#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {5136#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {5136#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {5136#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,749 INFO L290 TraceCheckUtils]: 55: Hoare triple {5136#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {5136#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {5136#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,749 INFO L290 TraceCheckUtils]: 58: Hoare triple {5136#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,749 INFO L290 TraceCheckUtils]: 59: Hoare triple {5136#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,749 INFO L290 TraceCheckUtils]: 60: Hoare triple {5136#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,749 INFO L290 TraceCheckUtils]: 61: Hoare triple {5136#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,749 INFO L290 TraceCheckUtils]: 62: Hoare triple {5136#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-27 15:25:32,749 INFO L290 TraceCheckUtils]: 63: Hoare triple {5136#false} assume 8672 == #t~mem74;havoc #t~mem74; {5136#false} is VALID [2022-04-27 15:25:32,749 INFO L290 TraceCheckUtils]: 64: Hoare triple {5136#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {5136#false} is VALID [2022-04-27 15:25:32,750 INFO L290 TraceCheckUtils]: 65: Hoare triple {5136#false} assume 4 == ~blastFlag~0; {5136#false} is VALID [2022-04-27 15:25:32,750 INFO L290 TraceCheckUtils]: 66: Hoare triple {5136#false} assume !false; {5136#false} is VALID [2022-04-27 15:25:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:25:32,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:32,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630653575] [2022-04-27 15:25:32,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630653575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:32,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:32,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:32,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365239743] [2022-04-27 15:25:32,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:32,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-27 15:25:32,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:32,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:32,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:32,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:32,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:32,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:32,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:32,801 INFO L87 Difference]: Start difference. First operand 166 states and 249 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:34,822 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-27 15:25:35,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:35,922 INFO L93 Difference]: Finished difference Result 422 states and 643 transitions. [2022-04-27 15:25:35,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:35,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-27 15:25:35,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-27 15:25:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-27 15:25:35,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-27 15:25:36,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:36,316 INFO L225 Difference]: With dead ends: 422 [2022-04-27 15:25:36,316 INFO L226 Difference]: Without dead ends: 282 [2022-04-27 15:25:36,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:36,317 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 144 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:36,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 321 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:25:36,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-04-27 15:25:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 178. [2022-04-27 15:25:36,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:36,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 178 states, 173 states have (on average 1.5086705202312138) internal successors, (261), 173 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-27 15:25:36,321 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 178 states, 173 states have (on average 1.5086705202312138) internal successors, (261), 173 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-27 15:25:36,321 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 178 states, 173 states have (on average 1.5086705202312138) internal successors, (261), 173 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-27 15:25:36,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:36,325 INFO L93 Difference]: Finished difference Result 282 states and 425 transitions. [2022-04-27 15:25:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 425 transitions. [2022-04-27 15:25:36,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:36,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:36,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 173 states have (on average 1.5086705202312138) internal successors, (261), 173 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 282 states. [2022-04-27 15:25:36,327 INFO L87 Difference]: Start difference. First operand has 178 states, 173 states have (on average 1.5086705202312138) internal successors, (261), 173 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 282 states. [2022-04-27 15:25:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:36,336 INFO L93 Difference]: Finished difference Result 282 states and 425 transitions. [2022-04-27 15:25:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 425 transitions. [2022-04-27 15:25:36,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:36,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:36,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:36,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.5086705202312138) internal successors, (261), 173 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-27 15:25:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 265 transitions. [2022-04-27 15:25:36,340 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 265 transitions. Word has length 67 [2022-04-27 15:25:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:36,340 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 265 transitions. [2022-04-27 15:25:36,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 265 transitions. [2022-04-27 15:25:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 15:25:36,342 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:36,342 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:36,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:25:36,342 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash -175906935, now seen corresponding path program 1 times [2022-04-27 15:25:36,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:36,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673851985] [2022-04-27 15:25:36,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:36,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:36,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:36,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {6432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {6425#true} is VALID [2022-04-27 15:25:36,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-27 15:25:36,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6425#true} {6425#true} #664#return; {6425#true} is VALID [2022-04-27 15:25:36,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {6425#true} call ULTIMATE.init(); {6432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:25:36,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {6432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {6425#true} is VALID [2022-04-27 15:25:36,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-27 15:25:36,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6425#true} {6425#true} #664#return; {6425#true} is VALID [2022-04-27 15:25:36,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {6425#true} call #t~ret162 := main(); {6425#true} is VALID [2022-04-27 15:25:36,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {6425#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {6425#true} is VALID [2022-04-27 15:25:36,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {6425#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6425#true} is VALID [2022-04-27 15:25:36,458 INFO L272 TraceCheckUtils]: 7: Hoare triple {6425#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6425#true} is VALID [2022-04-27 15:25:36,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {6425#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:36,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:36,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:36,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {6430#(= 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)))); {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:36,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:36,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:36,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:36,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:36,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:36,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {6431#(= 8464 |ssl3_accept_#t~mem44|)} is VALID [2022-04-27 15:25:36,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {6431#(= 8464 |ssl3_accept_#t~mem44|)} assume 8192 == #t~mem44;havoc #t~mem44; {6426#false} is VALID [2022-04-27 15:25:36,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {6426#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {6426#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6426#false} is VALID [2022-04-27 15:25:36,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {6426#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {6426#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {6426#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {6426#false} is VALID [2022-04-27 15:25:36,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {6426#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {6426#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {6426#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {6426#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {6426#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {6426#false} ~skip~0 := 0; {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {6426#false} assume !false; {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {6426#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {6426#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 33: Hoare triple {6426#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 34: Hoare triple {6426#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {6426#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {6426#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {6426#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {6426#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {6426#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 40: Hoare triple {6426#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {6426#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {6426#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {6426#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {6426#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {6426#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {6426#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {6426#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {6426#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {6426#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {6426#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 51: Hoare triple {6426#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {6426#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 53: Hoare triple {6426#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 54: Hoare triple {6426#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,465 INFO L290 TraceCheckUtils]: 55: Hoare triple {6426#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,466 INFO L290 TraceCheckUtils]: 56: Hoare triple {6426#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,466 INFO L290 TraceCheckUtils]: 57: Hoare triple {6426#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,466 INFO L290 TraceCheckUtils]: 58: Hoare triple {6426#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,466 INFO L290 TraceCheckUtils]: 59: Hoare triple {6426#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,466 INFO L290 TraceCheckUtils]: 60: Hoare triple {6426#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {6426#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,466 INFO L290 TraceCheckUtils]: 62: Hoare triple {6426#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,466 INFO L290 TraceCheckUtils]: 63: Hoare triple {6426#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-27 15:25:36,466 INFO L290 TraceCheckUtils]: 64: Hoare triple {6426#false} assume 8672 == #t~mem74;havoc #t~mem74; {6426#false} is VALID [2022-04-27 15:25:36,466 INFO L290 TraceCheckUtils]: 65: Hoare triple {6426#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {6426#false} is VALID [2022-04-27 15:25:36,466 INFO L290 TraceCheckUtils]: 66: Hoare triple {6426#false} assume 4 == ~blastFlag~0; {6426#false} is VALID [2022-04-27 15:25:36,466 INFO L290 TraceCheckUtils]: 67: Hoare triple {6426#false} assume !false; {6426#false} is VALID [2022-04-27 15:25:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:25:36,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:36,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673851985] [2022-04-27 15:25:36,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673851985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:36,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:36,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:36,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327416606] [2022-04-27 15:25:36,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:36,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-27 15:25:36,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:36,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:36,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:36,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:36,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:36,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:36,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:36,513 INFO L87 Difference]: Start difference. First operand 178 states and 265 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:38,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:39,386 INFO L93 Difference]: Finished difference Result 343 states and 514 transitions. [2022-04-27 15:25:39,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:39,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-27 15:25:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:39,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-27 15:25:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-27 15:25:39,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 428 transitions. [2022-04-27 15:25:39,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:39,672 INFO L225 Difference]: With dead ends: 343 [2022-04-27 15:25:39,672 INFO L226 Difference]: Without dead ends: 191 [2022-04-27 15:25:39,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:39,673 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:39,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:25:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-27 15:25:39,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2022-04-27 15:25:39,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:39,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 178 states, 173 states have (on average 1.5028901734104045) internal successors, (260), 173 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:39,677 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 178 states, 173 states have (on average 1.5028901734104045) internal successors, (260), 173 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:39,678 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 178 states, 173 states have (on average 1.5028901734104045) internal successors, (260), 173 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:39,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:39,682 INFO L93 Difference]: Finished difference Result 191 states and 281 transitions. [2022-04-27 15:25:39,682 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 281 transitions. [2022-04-27 15:25:39,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:39,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:39,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 173 states have (on average 1.5028901734104045) internal successors, (260), 173 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-27 15:25:39,683 INFO L87 Difference]: Start difference. First operand has 178 states, 173 states have (on average 1.5028901734104045) internal successors, (260), 173 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-27 15:25:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:39,686 INFO L93 Difference]: Finished difference Result 191 states and 281 transitions. [2022-04-27 15:25:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 281 transitions. [2022-04-27 15:25:39,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:39,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:39,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:39,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.5028901734104045) internal successors, (260), 173 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 264 transitions. [2022-04-27 15:25:39,689 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 264 transitions. Word has length 68 [2022-04-27 15:25:39,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:39,689 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 264 transitions. [2022-04-27 15:25:39,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 264 transitions. [2022-04-27 15:25:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-27 15:25:39,689 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:39,690 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:39,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:25:39,690 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:39,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:39,690 INFO L85 PathProgramCache]: Analyzing trace with hash -167412983, now seen corresponding path program 1 times [2022-04-27 15:25:39,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:39,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374641282] [2022-04-27 15:25:39,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:39,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:39,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:39,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {7444#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {7437#true} is VALID [2022-04-27 15:25:39,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {7437#true} assume true; {7437#true} is VALID [2022-04-27 15:25:39,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7437#true} {7437#true} #664#return; {7437#true} is VALID [2022-04-27 15:25:39,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {7437#true} call ULTIMATE.init(); {7444#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:25:39,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {7444#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {7437#true} is VALID [2022-04-27 15:25:39,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {7437#true} assume true; {7437#true} is VALID [2022-04-27 15:25:39,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7437#true} {7437#true} #664#return; {7437#true} is VALID [2022-04-27 15:25:39,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {7437#true} call #t~ret162 := main(); {7437#true} is VALID [2022-04-27 15:25:39,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {7437#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {7437#true} is VALID [2022-04-27 15:25:39,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {7437#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {7437#true} is VALID [2022-04-27 15:25:39,809 INFO L272 TraceCheckUtils]: 7: Hoare triple {7437#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7437#true} is VALID [2022-04-27 15:25:39,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {7437#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:39,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:39,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:39,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {7442#(= 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)))); {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:39,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:39,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:39,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:39,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:39,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:39,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:39,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7443#(= 8464 |ssl3_accept_#t~mem45|)} is VALID [2022-04-27 15:25:39,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {7443#(= 8464 |ssl3_accept_#t~mem45|)} assume 24576 == #t~mem45;havoc #t~mem45; {7438#false} is VALID [2022-04-27 15:25:39,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {7438#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {7438#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7438#false} is VALID [2022-04-27 15:25:39,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {7438#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {7438#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {7438#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {7438#false} is VALID [2022-04-27 15:25:39,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {7438#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {7438#false} is VALID [2022-04-27 15:25:39,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {7438#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {7438#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {7438#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {7438#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {7438#false} is VALID [2022-04-27 15:25:39,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {7438#false} ~skip~0 := 0; {7438#false} is VALID [2022-04-27 15:25:39,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {7438#false} assume !false; {7438#false} is VALID [2022-04-27 15:25:39,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {7438#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {7438#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {7438#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {7438#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,819 INFO L290 TraceCheckUtils]: 36: Hoare triple {7438#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {7438#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {7438#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 39: Hoare triple {7438#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 40: Hoare triple {7438#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {7438#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {7438#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {7438#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 44: Hoare triple {7438#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {7438#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {7438#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {7438#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {7438#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {7438#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 50: Hoare triple {7438#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 51: Hoare triple {7438#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 52: Hoare triple {7438#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {7438#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,820 INFO L290 TraceCheckUtils]: 54: Hoare triple {7438#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {7438#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {7438#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {7438#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {7438#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {7438#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {7438#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {7438#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,821 INFO L290 TraceCheckUtils]: 62: Hoare triple {7438#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,821 INFO L290 TraceCheckUtils]: 63: Hoare triple {7438#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,821 INFO L290 TraceCheckUtils]: 64: Hoare triple {7438#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-27 15:25:39,821 INFO L290 TraceCheckUtils]: 65: Hoare triple {7438#false} assume 8672 == #t~mem74;havoc #t~mem74; {7438#false} is VALID [2022-04-27 15:25:39,821 INFO L290 TraceCheckUtils]: 66: Hoare triple {7438#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {7438#false} is VALID [2022-04-27 15:25:39,821 INFO L290 TraceCheckUtils]: 67: Hoare triple {7438#false} assume 4 == ~blastFlag~0; {7438#false} is VALID [2022-04-27 15:25:39,821 INFO L290 TraceCheckUtils]: 68: Hoare triple {7438#false} assume !false; {7438#false} is VALID [2022-04-27 15:25:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:25:39,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:39,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374641282] [2022-04-27 15:25:39,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374641282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:39,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:39,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:39,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891945106] [2022-04-27 15:25:39,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:39,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-27 15:25:39,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:39,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:39,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:39,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:39,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:39,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:39,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:39,872 INFO L87 Difference]: Start difference. First operand 178 states and 264 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:41,892 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-27 15:25:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:42,756 INFO L93 Difference]: Finished difference Result 343 states and 513 transitions. [2022-04-27 15:25:42,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:42,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-27 15:25:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-27 15:25:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-27 15:25:42,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-27 15:25:43,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:43,131 INFO L225 Difference]: With dead ends: 343 [2022-04-27 15:25:43,131 INFO L226 Difference]: Without dead ends: 191 [2022-04-27 15:25:43,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:43,134 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 20 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:43,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:25:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-27 15:25:43,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2022-04-27 15:25:43,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:43,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 178 states, 173 states have (on average 1.4971098265895955) internal successors, (259), 173 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:43,145 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 178 states, 173 states have (on average 1.4971098265895955) internal successors, (259), 173 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:43,146 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 178 states, 173 states have (on average 1.4971098265895955) internal successors, (259), 173 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:43,148 INFO L93 Difference]: Finished difference Result 191 states and 280 transitions. [2022-04-27 15:25:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 280 transitions. [2022-04-27 15:25:43,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:43,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:43,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 173 states have (on average 1.4971098265895955) internal successors, (259), 173 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-27 15:25:43,149 INFO L87 Difference]: Start difference. First operand has 178 states, 173 states have (on average 1.4971098265895955) internal successors, (259), 173 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-27 15:25:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:43,152 INFO L93 Difference]: Finished difference Result 191 states and 280 transitions. [2022-04-27 15:25:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 280 transitions. [2022-04-27 15:25:43,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:43,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:43,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:43,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.4971098265895955) internal successors, (259), 173 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 263 transitions. [2022-04-27 15:25:43,155 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 263 transitions. Word has length 69 [2022-04-27 15:25:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:43,155 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 263 transitions. [2022-04-27 15:25:43,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:43,155 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 263 transitions. [2022-04-27 15:25:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-27 15:25:43,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:43,159 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:43,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:25:43,159 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:43,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:43,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1642777843, now seen corresponding path program 1 times [2022-04-27 15:25:43,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:43,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175364171] [2022-04-27 15:25:43,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:43,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:43,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:43,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {8456#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {8449#true} is VALID [2022-04-27 15:25:43,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {8449#true} assume true; {8449#true} is VALID [2022-04-27 15:25:43,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8449#true} {8449#true} #664#return; {8449#true} is VALID [2022-04-27 15:25:43,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {8449#true} call ULTIMATE.init(); {8456#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:25:43,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {8456#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {8449#true} is VALID [2022-04-27 15:25:43,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {8449#true} assume true; {8449#true} is VALID [2022-04-27 15:25:43,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8449#true} {8449#true} #664#return; {8449#true} is VALID [2022-04-27 15:25:43,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {8449#true} call #t~ret162 := main(); {8449#true} is VALID [2022-04-27 15:25:43,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {8449#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {8449#true} is VALID [2022-04-27 15:25:43,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {8449#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8449#true} is VALID [2022-04-27 15:25:43,273 INFO L272 TraceCheckUtils]: 7: Hoare triple {8449#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {8449#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {8449#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {8449#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {8449#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {8449#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {8449#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {8449#true} assume !false; {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {8449#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {8449#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {8449#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {8449#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {8449#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {8449#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {8449#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {8449#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-27 15:25:43,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {8449#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-27 15:25:43,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {8449#true} assume 8464 == #t~mem50;havoc #t~mem50; {8449#true} is VALID [2022-04-27 15:25:43,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {8449#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {8449#true} is VALID [2022-04-27 15:25:43,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {8449#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {8449#true} is VALID [2022-04-27 15:25:43,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {8449#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,280 INFO L290 TraceCheckUtils]: 41: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,282 INFO L290 TraceCheckUtils]: 45: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,282 INFO L290 TraceCheckUtils]: 46: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,283 INFO L290 TraceCheckUtils]: 49: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,283 INFO L290 TraceCheckUtils]: 50: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,284 INFO L290 TraceCheckUtils]: 53: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,285 INFO L290 TraceCheckUtils]: 54: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,285 INFO L290 TraceCheckUtils]: 55: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,285 INFO L290 TraceCheckUtils]: 56: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,286 INFO L290 TraceCheckUtils]: 57: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,286 INFO L290 TraceCheckUtils]: 59: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,287 INFO L290 TraceCheckUtils]: 62: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,288 INFO L290 TraceCheckUtils]: 63: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:43,288 INFO L290 TraceCheckUtils]: 64: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {8455#(not (= |ssl3_accept_#t~mem74| 8672))} is VALID [2022-04-27 15:25:43,288 INFO L290 TraceCheckUtils]: 65: Hoare triple {8455#(not (= |ssl3_accept_#t~mem74| 8672))} assume 8672 == #t~mem74;havoc #t~mem74; {8450#false} is VALID [2022-04-27 15:25:43,289 INFO L290 TraceCheckUtils]: 66: Hoare triple {8450#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {8450#false} is VALID [2022-04-27 15:25:43,289 INFO L290 TraceCheckUtils]: 67: Hoare triple {8450#false} assume 4 == ~blastFlag~0; {8450#false} is VALID [2022-04-27 15:25:43,289 INFO L290 TraceCheckUtils]: 68: Hoare triple {8450#false} assume !false; {8450#false} is VALID [2022-04-27 15:25:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:25:43,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:43,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175364171] [2022-04-27 15:25:43,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175364171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:43,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:43,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:43,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376823107] [2022-04-27 15:25:43,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:43,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-27 15:25:43,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:43,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:43,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:43,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:43,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:43,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:43,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:43,353 INFO L87 Difference]: Start difference. First operand 178 states and 263 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:45,372 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-27 15:25:46,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:46,465 INFO L93 Difference]: Finished difference Result 450 states and 680 transitions. [2022-04-27 15:25:46,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:46,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-27 15:25:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:46,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-27 15:25:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-27 15:25:46,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 575 transitions. [2022-04-27 15:25:46,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:46,871 INFO L225 Difference]: With dead ends: 450 [2022-04-27 15:25:46,871 INFO L226 Difference]: Without dead ends: 298 [2022-04-27 15:25:46,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:46,872 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 112 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:46,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 322 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:25:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-04-27 15:25:46,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 225. [2022-04-27 15:25:46,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:46,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states. Second operand has 225 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 220 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:46,876 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states. Second operand has 225 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 220 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:46,878 INFO L87 Difference]: Start difference. First operand 298 states. Second operand has 225 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 220 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:46,882 INFO L93 Difference]: Finished difference Result 298 states and 447 transitions. [2022-04-27 15:25:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 447 transitions. [2022-04-27 15:25:46,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:46,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:46,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 220 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 298 states. [2022-04-27 15:25:46,883 INFO L87 Difference]: Start difference. First operand has 225 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 220 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 298 states. [2022-04-27 15:25:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:46,889 INFO L93 Difference]: Finished difference Result 298 states and 447 transitions. [2022-04-27 15:25:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 447 transitions. [2022-04-27 15:25:46,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:46,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:46,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:46,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:46,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 220 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 349 transitions. [2022-04-27 15:25:46,894 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 349 transitions. Word has length 69 [2022-04-27 15:25:46,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:46,894 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 349 transitions. [2022-04-27 15:25:46,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 349 transitions. [2022-04-27 15:25:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-27 15:25:46,894 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:46,894 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:46,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:25:46,895 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:46,895 INFO L85 PathProgramCache]: Analyzing trace with hash 606399189, now seen corresponding path program 1 times [2022-04-27 15:25:46,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:46,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136538675] [2022-04-27 15:25:46,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:46,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:46,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:47,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {9859#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {9852#true} is VALID [2022-04-27 15:25:47,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {9852#true} assume true; {9852#true} is VALID [2022-04-27 15:25:47,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9852#true} {9852#true} #664#return; {9852#true} is VALID [2022-04-27 15:25:47,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {9852#true} call ULTIMATE.init(); {9859#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:25:47,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {9859#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {9852#true} is VALID [2022-04-27 15:25:47,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {9852#true} assume true; {9852#true} is VALID [2022-04-27 15:25:47,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9852#true} {9852#true} #664#return; {9852#true} is VALID [2022-04-27 15:25:47,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {9852#true} call #t~ret162 := main(); {9852#true} is VALID [2022-04-27 15:25:47,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {9852#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {9852#true} is VALID [2022-04-27 15:25:47,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {9852#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9852#true} is VALID [2022-04-27 15:25:47,005 INFO L272 TraceCheckUtils]: 7: Hoare triple {9852#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9852#true} is VALID [2022-04-27 15:25:47,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {9852#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9852#true} is VALID [2022-04-27 15:25:47,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {9852#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {9852#true} is VALID [2022-04-27 15:25:47,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {9852#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {9852#true} is VALID [2022-04-27 15:25:47,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {9852#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9852#true} is VALID [2022-04-27 15:25:47,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {9852#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9852#true} is VALID [2022-04-27 15:25:47,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {9852#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {9852#true} is VALID [2022-04-27 15:25:47,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {9852#true} assume !false; {9852#true} is VALID [2022-04-27 15:25:47,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {9852#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-27 15:25:47,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {9852#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-27 15:25:47,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {9852#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-27 15:25:47,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {9852#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-27 15:25:47,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {9852#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-27 15:25:47,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {9852#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-27 15:25:47,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {9852#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-27 15:25:47,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {9852#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-27 15:25:47,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {9852#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-27 15:25:47,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {9852#true} assume 8464 == #t~mem50;havoc #t~mem50; {9852#true} is VALID [2022-04-27 15:25:47,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {9852#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {9852#true} is VALID [2022-04-27 15:25:47,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {9852#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9852#true} is VALID [2022-04-27 15:25:47,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {9852#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,012 INFO L290 TraceCheckUtils]: 43: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,013 INFO L290 TraceCheckUtils]: 46: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,014 INFO L290 TraceCheckUtils]: 48: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,014 INFO L290 TraceCheckUtils]: 49: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,015 INFO L290 TraceCheckUtils]: 50: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,015 INFO L290 TraceCheckUtils]: 52: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,016 INFO L290 TraceCheckUtils]: 54: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,017 INFO L290 TraceCheckUtils]: 56: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,019 INFO L290 TraceCheckUtils]: 57: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,020 INFO L290 TraceCheckUtils]: 58: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,020 INFO L290 TraceCheckUtils]: 59: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,020 INFO L290 TraceCheckUtils]: 60: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,021 INFO L290 TraceCheckUtils]: 61: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,022 INFO L290 TraceCheckUtils]: 64: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:47,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8672 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9858#(not (= |ssl3_accept_#t~mem75| 8673))} is VALID [2022-04-27 15:25:47,022 INFO L290 TraceCheckUtils]: 66: Hoare triple {9858#(not (= |ssl3_accept_#t~mem75| 8673))} assume 8673 == #t~mem75;havoc #t~mem75; {9853#false} is VALID [2022-04-27 15:25:47,022 INFO L290 TraceCheckUtils]: 67: Hoare triple {9853#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {9853#false} is VALID [2022-04-27 15:25:47,022 INFO L290 TraceCheckUtils]: 68: Hoare triple {9853#false} assume 4 == ~blastFlag~0; {9853#false} is VALID [2022-04-27 15:25:47,023 INFO L290 TraceCheckUtils]: 69: Hoare triple {9853#false} assume !false; {9853#false} is VALID [2022-04-27 15:25:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:25:47,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:47,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136538675] [2022-04-27 15:25:47,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136538675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:47,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:47,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:47,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716545224] [2022-04-27 15:25:47,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:47,024 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-27 15:25:47,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:47,024 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-27 15:25:47,069 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-27 15:25:47,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:47,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:47,070 INFO L87 Difference]: Start difference. First operand 225 states and 349 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-27 15:25:49,099 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-27 15:25:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:50,310 INFO L93 Difference]: Finished difference Result 524 states and 819 transitions. [2022-04-27 15:25:50,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:50,310 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-27 15:25:50,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:50,312 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-27 15:25:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-27 15:25:50,315 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-27 15:25:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-27 15:25:50,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 575 transitions. [2022-04-27 15:25:50,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:50,763 INFO L225 Difference]: With dead ends: 524 [2022-04-27 15:25:50,763 INFO L226 Difference]: Without dead ends: 323 [2022-04-27 15:25:50,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:50,764 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 113 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:50,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 337 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 474 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:25:50,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-04-27 15:25:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 251. [2022-04-27 15:25:50,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:50,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 323 states. Second operand has 251 states, 246 states have (on average 1.6097560975609757) internal successors, (396), 246 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:50,781 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand has 251 states, 246 states have (on average 1.6097560975609757) internal successors, (396), 246 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:50,791 INFO L87 Difference]: Start difference. First operand 323 states. Second operand has 251 states, 246 states have (on average 1.6097560975609757) internal successors, (396), 246 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:50,796 INFO L93 Difference]: Finished difference Result 323 states and 497 transitions. [2022-04-27 15:25:50,796 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 497 transitions. [2022-04-27 15:25:50,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:50,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:50,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 251 states, 246 states have (on average 1.6097560975609757) internal successors, (396), 246 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 323 states. [2022-04-27 15:25:50,797 INFO L87 Difference]: Start difference. First operand has 251 states, 246 states have (on average 1.6097560975609757) internal successors, (396), 246 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 323 states. [2022-04-27 15:25:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:50,815 INFO L93 Difference]: Finished difference Result 323 states and 497 transitions. [2022-04-27 15:25:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 497 transitions. [2022-04-27 15:25:50,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:50,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:50,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:50,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 246 states have (on average 1.6097560975609757) internal successors, (396), 246 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 400 transitions. [2022-04-27 15:25:50,823 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 400 transitions. Word has length 70 [2022-04-27 15:25:50,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:50,824 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 400 transitions. [2022-04-27 15:25:50,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 400 transitions. [2022-04-27 15:25:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-27 15:25:50,825 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:50,825 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:50,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:25:50,826 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:50,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:50,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2001849160, now seen corresponding path program 1 times [2022-04-27 15:25:50,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:50,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540221141] [2022-04-27 15:25:50,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:50,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:50,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:50,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {11414#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {11407#true} is VALID [2022-04-27 15:25:50,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-04-27 15:25:50,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11407#true} {11407#true} #664#return; {11407#true} is VALID [2022-04-27 15:25:50,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {11407#true} call ULTIMATE.init(); {11414#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:25:50,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {11414#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {11407#true} is VALID [2022-04-27 15:25:50,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-04-27 15:25:50,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11407#true} {11407#true} #664#return; {11407#true} is VALID [2022-04-27 15:25:50,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {11407#true} call #t~ret162 := main(); {11407#true} is VALID [2022-04-27 15:25:50,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {11407#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {11407#true} is VALID [2022-04-27 15:25:50,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {11407#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {11407#true} is VALID [2022-04-27 15:25:50,979 INFO L272 TraceCheckUtils]: 7: Hoare triple {11407#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11407#true} is VALID [2022-04-27 15:25:50,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {11407#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11407#true} is VALID [2022-04-27 15:25:50,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {11407#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {11407#true} is VALID [2022-04-27 15:25:50,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {11407#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {11407#true} is VALID [2022-04-27 15:25:50,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {11407#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11407#true} is VALID [2022-04-27 15:25:50,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {11407#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {11407#true} is VALID [2022-04-27 15:25:50,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {11407#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {11407#true} is VALID [2022-04-27 15:25:50,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {11407#true} assume !false; {11407#true} is VALID [2022-04-27 15:25:50,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {11407#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-27 15:25:50,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {11407#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-27 15:25:50,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {11407#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-27 15:25:50,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {11407#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-27 15:25:50,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {11407#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-27 15:25:50,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {11407#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-27 15:25:50,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {11407#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-27 15:25:50,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {11407#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-27 15:25:50,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {11407#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-27 15:25:50,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {11407#true} assume 8464 == #t~mem50;havoc #t~mem50; {11407#true} is VALID [2022-04-27 15:25:50,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {11407#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {11407#true} is VALID [2022-04-27 15:25:50,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {11407#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11407#true} is VALID [2022-04-27 15:25:50,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {11407#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,986 INFO L290 TraceCheckUtils]: 40: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,986 INFO L290 TraceCheckUtils]: 41: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,986 INFO L290 TraceCheckUtils]: 42: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:50,986 INFO L290 TraceCheckUtils]: 43: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11413#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-27 15:25:50,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {11413#(= |ssl3_accept_#t~mem53| 8496)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {11408#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {11408#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {11408#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {11408#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,987 INFO L290 TraceCheckUtils]: 49: Hoare triple {11408#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,987 INFO L290 TraceCheckUtils]: 50: Hoare triple {11408#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,987 INFO L290 TraceCheckUtils]: 51: Hoare triple {11408#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,987 INFO L290 TraceCheckUtils]: 52: Hoare triple {11408#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,987 INFO L290 TraceCheckUtils]: 53: Hoare triple {11408#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,987 INFO L290 TraceCheckUtils]: 54: Hoare triple {11408#false} assume 8448 == #t~mem63;havoc #t~mem63; {11408#false} is VALID [2022-04-27 15:25:50,987 INFO L290 TraceCheckUtils]: 55: Hoare triple {11408#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {11408#false} assume !(~num1~0 > 0); {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {11408#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {11408#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 59: Hoare triple {11408#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 60: Hoare triple {11408#false} ~skip~0 := 0; {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 61: Hoare triple {11408#false} assume !false; {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 62: Hoare triple {11408#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 63: Hoare triple {11408#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 64: Hoare triple {11408#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 65: Hoare triple {11408#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 66: Hoare triple {11408#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 67: Hoare triple {11408#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 68: Hoare triple {11408#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 69: Hoare triple {11408#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 70: Hoare triple {11408#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 71: Hoare triple {11408#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,988 INFO L290 TraceCheckUtils]: 72: Hoare triple {11408#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 73: Hoare triple {11408#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 74: Hoare triple {11408#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 75: Hoare triple {11408#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 76: Hoare triple {11408#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 77: Hoare triple {11408#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 78: Hoare triple {11408#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 79: Hoare triple {11408#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 80: Hoare triple {11408#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 81: Hoare triple {11408#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 82: Hoare triple {11408#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 83: Hoare triple {11408#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 84: Hoare triple {11408#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 85: Hoare triple {11408#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 86: Hoare triple {11408#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 87: Hoare triple {11408#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,989 INFO L290 TraceCheckUtils]: 88: Hoare triple {11408#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,990 INFO L290 TraceCheckUtils]: 89: Hoare triple {11408#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,990 INFO L290 TraceCheckUtils]: 90: Hoare triple {11408#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,990 INFO L290 TraceCheckUtils]: 91: Hoare triple {11408#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,990 INFO L290 TraceCheckUtils]: 92: Hoare triple {11408#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,990 INFO L290 TraceCheckUtils]: 93: Hoare triple {11408#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,990 INFO L290 TraceCheckUtils]: 94: Hoare triple {11408#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-27 15:25:50,990 INFO L290 TraceCheckUtils]: 95: Hoare triple {11408#false} assume 8672 == #t~mem74;havoc #t~mem74; {11408#false} is VALID [2022-04-27 15:25:50,990 INFO L290 TraceCheckUtils]: 96: Hoare triple {11408#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {11408#false} is VALID [2022-04-27 15:25:50,990 INFO L290 TraceCheckUtils]: 97: Hoare triple {11408#false} assume 4 == ~blastFlag~0; {11408#false} is VALID [2022-04-27 15:25:50,990 INFO L290 TraceCheckUtils]: 98: Hoare triple {11408#false} assume !false; {11408#false} is VALID [2022-04-27 15:25:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 15:25:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:50,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540221141] [2022-04-27 15:25:50,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540221141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:50,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:50,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:50,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098175909] [2022-04-27 15:25:50,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:50,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-04-27 15:25:50,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:50,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:51,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:51,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:51,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:51,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:51,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:51,055 INFO L87 Difference]: Start difference. First operand 251 states and 400 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:53,075 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-27 15:25:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:54,057 INFO L93 Difference]: Finished difference Result 519 states and 833 transitions. [2022-04-27 15:25:54,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:54,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-04-27 15:25:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-27 15:25:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:54,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-27 15:25:54,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-27 15:25:54,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:54,368 INFO L225 Difference]: With dead ends: 519 [2022-04-27 15:25:54,368 INFO L226 Difference]: Without dead ends: 294 [2022-04-27 15:25:54,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:54,369 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 32 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:54,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 514 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 406 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:25:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-27 15:25:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 273. [2022-04-27 15:25:54,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:54,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 273 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 268 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:54,374 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 273 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 268 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:54,374 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 273 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 268 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:54,378 INFO L93 Difference]: Finished difference Result 294 states and 463 transitions. [2022-04-27 15:25:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 463 transitions. [2022-04-27 15:25:54,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:54,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:54,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 268 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 294 states. [2022-04-27 15:25:54,379 INFO L87 Difference]: Start difference. First operand has 273 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 268 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 294 states. [2022-04-27 15:25:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:54,383 INFO L93 Difference]: Finished difference Result 294 states and 463 transitions. [2022-04-27 15:25:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 463 transitions. [2022-04-27 15:25:54,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:54,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:54,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:54,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 268 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:54,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 436 transitions. [2022-04-27 15:25:54,387 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 436 transitions. Word has length 99 [2022-04-27 15:25:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:54,387 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 436 transitions. [2022-04-27 15:25:54,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 436 transitions. [2022-04-27 15:25:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 15:25:54,388 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:54,388 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:25:54,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:25:54,388 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:54,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:54,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1138549791, now seen corresponding path program 1 times [2022-04-27 15:25:54,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:54,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037046022] [2022-04-27 15:25:54,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:54,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:54,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:54,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {12917#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {12910#true} is VALID [2022-04-27 15:25:54,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {12910#true} assume true; {12910#true} is VALID [2022-04-27 15:25:54,476 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12910#true} {12910#true} #664#return; {12910#true} is VALID [2022-04-27 15:25:54,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {12910#true} call ULTIMATE.init(); {12917#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:25:54,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {12917#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {12910#true} is VALID [2022-04-27 15:25:54,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {12910#true} assume true; {12910#true} is VALID [2022-04-27 15:25:54,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12910#true} {12910#true} #664#return; {12910#true} is VALID [2022-04-27 15:25:54,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {12910#true} call #t~ret162 := main(); {12910#true} is VALID [2022-04-27 15:25:54,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {12910#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {12910#true} is VALID [2022-04-27 15:25:54,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {12910#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12910#true} is VALID [2022-04-27 15:25:54,478 INFO L272 TraceCheckUtils]: 7: Hoare triple {12910#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12910#true} is VALID [2022-04-27 15:25:54,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {12910#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:54,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:54,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:54,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {12915#(not (= 8195 (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)))); {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:54,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:54,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:54,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:54,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:54,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:54,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:54,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:54,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {12916#(not (= |ssl3_accept_#t~mem46| 8195))} is VALID [2022-04-27 15:25:54,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {12916#(not (= |ssl3_accept_#t~mem46| 8195))} assume 8195 == #t~mem46;havoc #t~mem46; {12911#false} is VALID [2022-04-27 15:25:54,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {12911#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {12911#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {12911#false} is VALID [2022-04-27 15:25:54,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {12911#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {12911#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {12911#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {12911#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {12911#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {12911#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {12911#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {12911#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {12911#false} ~skip~0 := 0; {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {12911#false} assume !false; {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {12911#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {12911#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {12911#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {12911#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {12911#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {12911#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 39: Hoare triple {12911#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {12911#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {12911#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {12911#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {12911#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {12911#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {12911#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 46: Hoare triple {12911#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 47: Hoare triple {12911#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 48: Hoare triple {12911#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 49: Hoare triple {12911#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 50: Hoare triple {12911#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 51: Hoare triple {12911#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 52: Hoare triple {12911#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 53: Hoare triple {12911#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 54: Hoare triple {12911#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 55: Hoare triple {12911#false} assume 8448 == #t~mem63;havoc #t~mem63; {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 56: Hoare triple {12911#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {12911#false} is VALID [2022-04-27 15:25:54,485 INFO L290 TraceCheckUtils]: 57: Hoare triple {12911#false} assume !(~num1~0 > 0); {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 58: Hoare triple {12911#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 59: Hoare triple {12911#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 60: Hoare triple {12911#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 61: Hoare triple {12911#false} ~skip~0 := 0; {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 62: Hoare triple {12911#false} assume !false; {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 63: Hoare triple {12911#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 64: Hoare triple {12911#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 65: Hoare triple {12911#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 66: Hoare triple {12911#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 67: Hoare triple {12911#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 68: Hoare triple {12911#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 69: Hoare triple {12911#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 70: Hoare triple {12911#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 71: Hoare triple {12911#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 72: Hoare triple {12911#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 73: Hoare triple {12911#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,486 INFO L290 TraceCheckUtils]: 74: Hoare triple {12911#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 75: Hoare triple {12911#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 76: Hoare triple {12911#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 77: Hoare triple {12911#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 78: Hoare triple {12911#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 79: Hoare triple {12911#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 80: Hoare triple {12911#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 81: Hoare triple {12911#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 82: Hoare triple {12911#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 83: Hoare triple {12911#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 84: Hoare triple {12911#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 85: Hoare triple {12911#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 86: Hoare triple {12911#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 87: Hoare triple {12911#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 88: Hoare triple {12911#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 89: Hoare triple {12911#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 90: Hoare triple {12911#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,487 INFO L290 TraceCheckUtils]: 91: Hoare triple {12911#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,488 INFO L290 TraceCheckUtils]: 92: Hoare triple {12911#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,488 INFO L290 TraceCheckUtils]: 93: Hoare triple {12911#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,488 INFO L290 TraceCheckUtils]: 94: Hoare triple {12911#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,488 INFO L290 TraceCheckUtils]: 95: Hoare triple {12911#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-27 15:25:54,488 INFO L290 TraceCheckUtils]: 96: Hoare triple {12911#false} assume 8672 == #t~mem74;havoc #t~mem74; {12911#false} is VALID [2022-04-27 15:25:54,488 INFO L290 TraceCheckUtils]: 97: Hoare triple {12911#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {12911#false} is VALID [2022-04-27 15:25:54,488 INFO L290 TraceCheckUtils]: 98: Hoare triple {12911#false} assume 4 == ~blastFlag~0; {12911#false} is VALID [2022-04-27 15:25:54,488 INFO L290 TraceCheckUtils]: 99: Hoare triple {12911#false} assume !false; {12911#false} is VALID [2022-04-27 15:25:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 15:25:54,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:54,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037046022] [2022-04-27 15:25:54,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037046022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:54,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:54,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261758201] [2022-04-27 15:25:54,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:54,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-27 15:25:54,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:54,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:54,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:54,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:54,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:54,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:54,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:54,544 INFO L87 Difference]: Start difference. First operand 273 states and 436 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:56,564 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-27 15:25:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:57,783 INFO L93 Difference]: Finished difference Result 592 states and 938 transitions. [2022-04-27 15:25:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:57,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-27 15:25:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:57,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-27 15:25:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-27 15:25:57,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 573 transitions. [2022-04-27 15:25:58,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 573 edges. 573 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:58,204 INFO L225 Difference]: With dead ends: 592 [2022-04-27 15:25:58,204 INFO L226 Difference]: Without dead ends: 345 [2022-04-27 15:25:58,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:58,205 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 138 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:58,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 341 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 473 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:25:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-27 15:25:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 273. [2022-04-27 15:25:58,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:58,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 273 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 268 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:58,210 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 273 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 268 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:58,210 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 273 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 268 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:58,216 INFO L93 Difference]: Finished difference Result 345 states and 528 transitions. [2022-04-27 15:25:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 528 transitions. [2022-04-27 15:25:58,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:58,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:58,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 268 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-27 15:25:58,218 INFO L87 Difference]: Start difference. First operand has 273 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 268 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-27 15:25:58,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:58,224 INFO L93 Difference]: Finished difference Result 345 states and 528 transitions. [2022-04-27 15:25:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 528 transitions. [2022-04-27 15:25:58,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:58,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:58,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:58,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 268 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 431 transitions. [2022-04-27 15:25:58,230 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 431 transitions. Word has length 100 [2022-04-27 15:25:58,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:58,231 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 431 transitions. [2022-04-27 15:25:58,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 431 transitions. [2022-04-27 15:25:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-27 15:25:58,232 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:58,232 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:58,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:25:58,233 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:58,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1952330836, now seen corresponding path program 1 times [2022-04-27 15:25:58,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:58,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128289337] [2022-04-27 15:25:58,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:58,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:58,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:58,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {14612#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {14605#true} is VALID [2022-04-27 15:25:58,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {14605#true} assume true; {14605#true} is VALID [2022-04-27 15:25:58,338 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14605#true} {14605#true} #664#return; {14605#true} is VALID [2022-04-27 15:25:58,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {14605#true} call ULTIMATE.init(); {14612#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:25:58,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {14612#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {14605#true} is VALID [2022-04-27 15:25:58,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {14605#true} assume true; {14605#true} is VALID [2022-04-27 15:25:58,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14605#true} {14605#true} #664#return; {14605#true} is VALID [2022-04-27 15:25:58,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {14605#true} call #t~ret162 := main(); {14605#true} is VALID [2022-04-27 15:25:58,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {14605#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {14605#true} is VALID [2022-04-27 15:25:58,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {14605#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {14605#true} is VALID [2022-04-27 15:25:58,339 INFO L272 TraceCheckUtils]: 7: Hoare triple {14605#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14605#true} is VALID [2022-04-27 15:25:58,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {14605#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {14605#true} is VALID [2022-04-27 15:25:58,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {14605#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {14605#true} is VALID [2022-04-27 15:25:58,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {14605#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {14605#true} is VALID [2022-04-27 15:25:58,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {14605#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14605#true} is VALID [2022-04-27 15:25:58,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {14605#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {14605#true} is VALID [2022-04-27 15:25:58,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {14605#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {14605#true} is VALID [2022-04-27 15:25:58,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {14605#true} assume !false; {14605#true} is VALID [2022-04-27 15:25:58,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {14605#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-27 15:25:58,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {14605#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-27 15:25:58,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {14605#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-27 15:25:58,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {14605#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-27 15:25:58,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {14605#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-27 15:25:58,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {14605#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-27 15:25:58,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {14605#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-27 15:25:58,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {14605#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-27 15:25:58,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {14605#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-27 15:25:58,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {14605#true} assume 8464 == #t~mem50;havoc #t~mem50; {14605#true} is VALID [2022-04-27 15:25:58,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {14605#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {14605#true} is VALID [2022-04-27 15:25:58,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {14605#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14605#true} is VALID [2022-04-27 15:25:58,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {14605#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:25:58,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:25:58,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:25:58,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:25:58,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:25:58,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:25:58,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:25:58,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:25:58,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:25:58,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:25:58,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:25:58,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14611#(not (= |ssl3_accept_#t~mem48| 8481))} is VALID [2022-04-27 15:25:58,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {14611#(not (= |ssl3_accept_#t~mem48| 8481))} assume 8481 == #t~mem48;havoc #t~mem48; {14606#false} is VALID [2022-04-27 15:25:58,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {14606#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {14606#false} is VALID [2022-04-27 15:25:58,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {14606#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem88.base, 844 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {14606#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {14606#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {14606#false} is VALID [2022-04-27 15:25:58,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {14606#false} ~skip~0 := 0; {14606#false} is VALID [2022-04-27 15:25:58,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {14606#false} assume !false; {14606#false} is VALID [2022-04-27 15:25:58,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {14606#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,345 INFO L290 TraceCheckUtils]: 47: Hoare triple {14606#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {14606#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {14606#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 50: Hoare triple {14606#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 51: Hoare triple {14606#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 52: Hoare triple {14606#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {14606#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 54: Hoare triple {14606#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 55: Hoare triple {14606#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 56: Hoare triple {14606#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 57: Hoare triple {14606#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 58: Hoare triple {14606#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 59: Hoare triple {14606#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 60: Hoare triple {14606#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 61: Hoare triple {14606#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 62: Hoare triple {14606#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 63: Hoare triple {14606#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 64: Hoare triple {14606#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 65: Hoare triple {14606#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,346 INFO L290 TraceCheckUtils]: 66: Hoare triple {14606#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 67: Hoare triple {14606#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 68: Hoare triple {14606#false} assume 8448 == #t~mem63;havoc #t~mem63; {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 69: Hoare triple {14606#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 70: Hoare triple {14606#false} assume !(~num1~0 > 0); {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 71: Hoare triple {14606#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 72: Hoare triple {14606#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 73: Hoare triple {14606#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 74: Hoare triple {14606#false} ~skip~0 := 0; {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 75: Hoare triple {14606#false} assume !false; {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 76: Hoare triple {14606#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 77: Hoare triple {14606#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 78: Hoare triple {14606#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 79: Hoare triple {14606#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 80: Hoare triple {14606#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 81: Hoare triple {14606#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 82: Hoare triple {14606#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,347 INFO L290 TraceCheckUtils]: 83: Hoare triple {14606#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 84: Hoare triple {14606#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 85: Hoare triple {14606#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 86: Hoare triple {14606#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 87: Hoare triple {14606#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 88: Hoare triple {14606#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 89: Hoare triple {14606#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 90: Hoare triple {14606#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 91: Hoare triple {14606#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 92: Hoare triple {14606#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 93: Hoare triple {14606#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 94: Hoare triple {14606#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 95: Hoare triple {14606#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 96: Hoare triple {14606#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 97: Hoare triple {14606#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 98: Hoare triple {14606#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,348 INFO L290 TraceCheckUtils]: 99: Hoare triple {14606#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,349 INFO L290 TraceCheckUtils]: 100: Hoare triple {14606#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,349 INFO L290 TraceCheckUtils]: 101: Hoare triple {14606#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,349 INFO L290 TraceCheckUtils]: 102: Hoare triple {14606#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,349 INFO L290 TraceCheckUtils]: 103: Hoare triple {14606#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,349 INFO L290 TraceCheckUtils]: 104: Hoare triple {14606#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,349 INFO L290 TraceCheckUtils]: 105: Hoare triple {14606#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,349 INFO L290 TraceCheckUtils]: 106: Hoare triple {14606#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,349 INFO L290 TraceCheckUtils]: 107: Hoare triple {14606#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,349 INFO L290 TraceCheckUtils]: 108: Hoare triple {14606#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-27 15:25:58,349 INFO L290 TraceCheckUtils]: 109: Hoare triple {14606#false} assume 8672 == #t~mem74;havoc #t~mem74; {14606#false} is VALID [2022-04-27 15:25:58,349 INFO L290 TraceCheckUtils]: 110: Hoare triple {14606#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {14606#false} is VALID [2022-04-27 15:25:58,349 INFO L290 TraceCheckUtils]: 111: Hoare triple {14606#false} assume 4 == ~blastFlag~0; {14606#false} is VALID [2022-04-27 15:25:58,349 INFO L290 TraceCheckUtils]: 112: Hoare triple {14606#false} assume !false; {14606#false} is VALID [2022-04-27 15:25:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 15:25:58,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:58,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128289337] [2022-04-27 15:25:58,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128289337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:58,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:58,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:58,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106047497] [2022-04-27 15:25:58,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-27 15:25:58,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:58,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:58,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:58,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:58,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:58,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:58,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:58,414 INFO L87 Difference]: Start difference. First operand 273 states and 431 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:00,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:26:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:01,577 INFO L93 Difference]: Finished difference Result 592 states and 929 transitions. [2022-04-27 15:26:01,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:01,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-27 15:26:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-27 15:26:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:01,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-27 15:26:01,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 572 transitions. [2022-04-27 15:26:01,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:01,883 INFO L225 Difference]: With dead ends: 592 [2022-04-27 15:26:01,883 INFO L226 Difference]: Without dead ends: 345 [2022-04-27 15:26:01,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:01,884 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 136 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:01,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 341 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 473 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:26:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-27 15:26:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 273. [2022-04-27 15:26:01,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:01,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 273 states, 268 states have (on average 1.5820895522388059) internal successors, (424), 268 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:01,888 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 273 states, 268 states have (on average 1.5820895522388059) internal successors, (424), 268 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:01,889 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 273 states, 268 states have (on average 1.5820895522388059) internal successors, (424), 268 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:01,893 INFO L93 Difference]: Finished difference Result 345 states and 525 transitions. [2022-04-27 15:26:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 525 transitions. [2022-04-27 15:26:01,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:01,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:01,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 268 states have (on average 1.5820895522388059) internal successors, (424), 268 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-27 15:26:01,894 INFO L87 Difference]: Start difference. First operand has 273 states, 268 states have (on average 1.5820895522388059) internal successors, (424), 268 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-27 15:26:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:01,899 INFO L93 Difference]: Finished difference Result 345 states and 525 transitions. [2022-04-27 15:26:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 525 transitions. [2022-04-27 15:26:01,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:01,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:01,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:01,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.5820895522388059) internal successors, (424), 268 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 428 transitions. [2022-04-27 15:26:01,903 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 428 transitions. Word has length 113 [2022-04-27 15:26:01,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:01,903 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 428 transitions. [2022-04-27 15:26:01,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 428 transitions. [2022-04-27 15:26:01,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-27 15:26:01,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:01,904 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:26:01,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:26:01,904 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:01,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:01,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1683189401, now seen corresponding path program 1 times [2022-04-27 15:26:01,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:01,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008498594] [2022-04-27 15:26:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:01,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:02,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:02,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {16307#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {16300#true} is VALID [2022-04-27 15:26:02,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-27 15:26:02,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16300#true} {16300#true} #664#return; {16300#true} is VALID [2022-04-27 15:26:02,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {16300#true} call ULTIMATE.init(); {16307#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:02,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {16307#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {16300#true} is VALID [2022-04-27 15:26:02,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-27 15:26:02,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16300#true} {16300#true} #664#return; {16300#true} is VALID [2022-04-27 15:26:02,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {16300#true} call #t~ret162 := main(); {16300#true} is VALID [2022-04-27 15:26:02,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {16300#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {16300#true} is VALID [2022-04-27 15:26:02,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {16300#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16300#true} is VALID [2022-04-27 15:26:02,030 INFO L272 TraceCheckUtils]: 7: Hoare triple {16300#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16300#true} is VALID [2022-04-27 15:26:02,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {16300#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {16300#true} is VALID [2022-04-27 15:26:02,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {16300#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {16300#true} is VALID [2022-04-27 15:26:02,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {16300#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {16300#true} is VALID [2022-04-27 15:26:02,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {16300#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16300#true} is VALID [2022-04-27 15:26:02,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {16300#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16300#true} is VALID [2022-04-27 15:26:02,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {16300#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {16300#true} is VALID [2022-04-27 15:26:02,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {16300#true} assume !false; {16300#true} is VALID [2022-04-27 15:26:02,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {16300#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-27 15:26:02,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {16300#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-27 15:26:02,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {16300#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-27 15:26:02,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {16300#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-27 15:26:02,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {16300#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-27 15:26:02,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {16300#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-27 15:26:02,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {16300#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-27 15:26:02,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {16300#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-27 15:26:02,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {16300#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-27 15:26:02,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {16300#true} assume 8464 == #t~mem50;havoc #t~mem50; {16300#true} is VALID [2022-04-27 15:26:02,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {16300#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {16300#true} is VALID [2022-04-27 15:26:02,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {16300#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16300#true} is VALID [2022-04-27 15:26:02,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {16300#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:02,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:02,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:02,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:02,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:02,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:02,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:02,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:02,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:02,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:02,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:02,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:02,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16306#(not (= |ssl3_accept_#t~mem49| 8482))} is VALID [2022-04-27 15:26:02,036 INFO L290 TraceCheckUtils]: 40: Hoare triple {16306#(not (= |ssl3_accept_#t~mem49| 8482))} assume 8482 == #t~mem49;havoc #t~mem49; {16301#false} is VALID [2022-04-27 15:26:02,036 INFO L290 TraceCheckUtils]: 41: Hoare triple {16301#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,036 INFO L290 TraceCheckUtils]: 42: Hoare triple {16301#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {16301#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {16301#false} ~skip~0 := 0; {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 46: Hoare triple {16301#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 47: Hoare triple {16301#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 48: Hoare triple {16301#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 49: Hoare triple {16301#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 50: Hoare triple {16301#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 51: Hoare triple {16301#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 52: Hoare triple {16301#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 53: Hoare triple {16301#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 54: Hoare triple {16301#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 55: Hoare triple {16301#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 56: Hoare triple {16301#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 57: Hoare triple {16301#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 58: Hoare triple {16301#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,037 INFO L290 TraceCheckUtils]: 59: Hoare triple {16301#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 60: Hoare triple {16301#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 61: Hoare triple {16301#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 62: Hoare triple {16301#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 63: Hoare triple {16301#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 64: Hoare triple {16301#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 65: Hoare triple {16301#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 66: Hoare triple {16301#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 67: Hoare triple {16301#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 68: Hoare triple {16301#false} assume 8448 == #t~mem63;havoc #t~mem63; {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 69: Hoare triple {16301#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 70: Hoare triple {16301#false} assume !(~num1~0 > 0); {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 71: Hoare triple {16301#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 72: Hoare triple {16301#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 73: Hoare triple {16301#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 74: Hoare triple {16301#false} ~skip~0 := 0; {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 75: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-27 15:26:02,038 INFO L290 TraceCheckUtils]: 76: Hoare triple {16301#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 77: Hoare triple {16301#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 78: Hoare triple {16301#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 79: Hoare triple {16301#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 80: Hoare triple {16301#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 81: Hoare triple {16301#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 82: Hoare triple {16301#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 83: Hoare triple {16301#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 84: Hoare triple {16301#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 85: Hoare triple {16301#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 86: Hoare triple {16301#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 87: Hoare triple {16301#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 88: Hoare triple {16301#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 89: Hoare triple {16301#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 90: Hoare triple {16301#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 91: Hoare triple {16301#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 92: Hoare triple {16301#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,039 INFO L290 TraceCheckUtils]: 93: Hoare triple {16301#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 94: Hoare triple {16301#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 95: Hoare triple {16301#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 96: Hoare triple {16301#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 97: Hoare triple {16301#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 98: Hoare triple {16301#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 99: Hoare triple {16301#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 100: Hoare triple {16301#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 101: Hoare triple {16301#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 102: Hoare triple {16301#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 103: Hoare triple {16301#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 104: Hoare triple {16301#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 105: Hoare triple {16301#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 106: Hoare triple {16301#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 107: Hoare triple {16301#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 108: Hoare triple {16301#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 109: Hoare triple {16301#false} assume 8672 == #t~mem74;havoc #t~mem74; {16301#false} is VALID [2022-04-27 15:26:02,040 INFO L290 TraceCheckUtils]: 110: Hoare triple {16301#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {16301#false} is VALID [2022-04-27 15:26:02,041 INFO L290 TraceCheckUtils]: 111: Hoare triple {16301#false} assume 4 == ~blastFlag~0; {16301#false} is VALID [2022-04-27 15:26:02,041 INFO L290 TraceCheckUtils]: 112: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-27 15:26:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 15:26:02,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:02,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008498594] [2022-04-27 15:26:02,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008498594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:02,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:02,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858702970] [2022-04-27 15:26:02,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:02,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-27 15:26:02,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:02,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:02,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:02,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:02,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:02,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:02,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:02,091 INFO L87 Difference]: Start difference. First operand 273 states and 428 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:05,176 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:26:07,184 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:26:09,208 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-27 15:26:12,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:26:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:13,849 INFO L93 Difference]: Finished difference Result 591 states and 922 transitions. [2022-04-27 15:26:13,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:13,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-27 15:26:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:13,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-27 15:26:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-27 15:26:13,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 570 transitions. [2022-04-27 15:26:14,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:14,209 INFO L225 Difference]: With dead ends: 591 [2022-04-27 15:26:14,210 INFO L226 Difference]: Without dead ends: 344 [2022-04-27 15:26:14,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:14,211 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 134 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 62 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:14,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 343 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 473 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-04-27 15:26:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-04-27 15:26:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 273. [2022-04-27 15:26:14,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:14,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 344 states. Second operand has 273 states, 268 states have (on average 1.5708955223880596) internal successors, (421), 268 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:14,248 INFO L74 IsIncluded]: Start isIncluded. First operand 344 states. Second operand has 273 states, 268 states have (on average 1.5708955223880596) internal successors, (421), 268 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:14,248 INFO L87 Difference]: Start difference. First operand 344 states. Second operand has 273 states, 268 states have (on average 1.5708955223880596) internal successors, (421), 268 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:14,253 INFO L93 Difference]: Finished difference Result 344 states and 521 transitions. [2022-04-27 15:26:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 521 transitions. [2022-04-27 15:26:14,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:14,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:14,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 268 states have (on average 1.5708955223880596) internal successors, (421), 268 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 344 states. [2022-04-27 15:26:14,256 INFO L87 Difference]: Start difference. First operand has 273 states, 268 states have (on average 1.5708955223880596) internal successors, (421), 268 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 344 states. [2022-04-27 15:26:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:14,261 INFO L93 Difference]: Finished difference Result 344 states and 521 transitions. [2022-04-27 15:26:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 521 transitions. [2022-04-27 15:26:14,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:14,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:14,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:14,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.5708955223880596) internal successors, (421), 268 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 425 transitions. [2022-04-27 15:26:14,265 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 425 transitions. Word has length 113 [2022-04-27 15:26:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:14,265 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 425 transitions. [2022-04-27 15:26:14,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 425 transitions. [2022-04-27 15:26:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 15:26:14,267 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:14,267 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:26:14,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:26:14,267 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:14,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2133756623, now seen corresponding path program 1 times [2022-04-27 15:26:14,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:14,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873393026] [2022-04-27 15:26:14,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:14,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:14,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:14,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {17998#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {17991#true} is VALID [2022-04-27 15:26:14,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {17991#true} assume true; {17991#true} is VALID [2022-04-27 15:26:14,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17991#true} {17991#true} #664#return; {17991#true} is VALID [2022-04-27 15:26:14,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {17991#true} call ULTIMATE.init(); {17998#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:14,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {17998#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {17991#true} is VALID [2022-04-27 15:26:14,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {17991#true} assume true; {17991#true} is VALID [2022-04-27 15:26:14,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17991#true} {17991#true} #664#return; {17991#true} is VALID [2022-04-27 15:26:14,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {17991#true} call #t~ret162 := main(); {17991#true} is VALID [2022-04-27 15:26:14,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {17991#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {17991#true} is VALID [2022-04-27 15:26:14,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {17991#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,451 INFO L272 TraceCheckUtils]: 7: Hoare triple {17991#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {17991#true} is VALID [2022-04-27 15:26:14,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {17991#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {17991#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {17991#true} is VALID [2022-04-27 15:26:14,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {17991#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {17991#true} is VALID [2022-04-27 15:26:14,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {17991#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17991#true} is VALID [2022-04-27 15:26:14,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {17991#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {17991#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {17991#true} is VALID [2022-04-27 15:26:14,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {17991#true} assume !false; {17991#true} is VALID [2022-04-27 15:26:14,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {17991#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {17991#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {17991#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {17991#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {17991#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {17991#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {17991#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {17991#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {17991#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {17991#true} assume 8464 == #t~mem50;havoc #t~mem50; {17991#true} is VALID [2022-04-27 15:26:14,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {17991#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {17991#true} is VALID [2022-04-27 15:26:14,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {17991#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17991#true} is VALID [2022-04-27 15:26:14,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {17991#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {17991#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {17991#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {17991#true} is VALID [2022-04-27 15:26:14,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {17991#true} ~skip~0 := 0; {17991#true} is VALID [2022-04-27 15:26:14,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {17991#true} assume !false; {17991#true} is VALID [2022-04-27 15:26:14,453 INFO L290 TraceCheckUtils]: 32: Hoare triple {17991#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,453 INFO L290 TraceCheckUtils]: 33: Hoare triple {17991#true} assume 12292 == #t~mem42;havoc #t~mem42; {17991#true} is VALID [2022-04-27 15:26:14,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {17991#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {17991#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {17991#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {17991#true} is VALID [2022-04-27 15:26:14,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {17991#true} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {17991#true} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {17991#true} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {17991#true} is VALID [2022-04-27 15:26:14,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {17991#true} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {17991#true} is VALID [2022-04-27 15:26:14,454 INFO L290 TraceCheckUtils]: 41: Hoare triple {17991#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-27 15:26:14,455 INFO L290 TraceCheckUtils]: 42: Hoare triple {17991#true} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:14,455 INFO L290 TraceCheckUtils]: 43: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:14,456 INFO L290 TraceCheckUtils]: 44: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:14,456 INFO L290 TraceCheckUtils]: 45: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:14,456 INFO L290 TraceCheckUtils]: 46: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:14,457 INFO L290 TraceCheckUtils]: 47: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:14,457 INFO L290 TraceCheckUtils]: 48: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:14,457 INFO L290 TraceCheckUtils]: 49: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:14,458 INFO L290 TraceCheckUtils]: 50: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:14,458 INFO L290 TraceCheckUtils]: 51: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:14,458 INFO L290 TraceCheckUtils]: 52: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {17997#(= |ssl3_accept_#t~mem47| 8480)} is VALID [2022-04-27 15:26:14,459 INFO L290 TraceCheckUtils]: 53: Hoare triple {17997#(= |ssl3_accept_#t~mem47| 8480)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,459 INFO L290 TraceCheckUtils]: 54: Hoare triple {17992#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,459 INFO L290 TraceCheckUtils]: 55: Hoare triple {17992#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,459 INFO L290 TraceCheckUtils]: 56: Hoare triple {17992#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,459 INFO L290 TraceCheckUtils]: 57: Hoare triple {17992#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,459 INFO L290 TraceCheckUtils]: 58: Hoare triple {17992#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,459 INFO L290 TraceCheckUtils]: 59: Hoare triple {17992#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,459 INFO L290 TraceCheckUtils]: 60: Hoare triple {17992#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,459 INFO L290 TraceCheckUtils]: 61: Hoare triple {17992#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,459 INFO L290 TraceCheckUtils]: 62: Hoare triple {17992#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,459 INFO L290 TraceCheckUtils]: 63: Hoare triple {17992#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,459 INFO L290 TraceCheckUtils]: 64: Hoare triple {17992#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,459 INFO L290 TraceCheckUtils]: 65: Hoare triple {17992#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,460 INFO L290 TraceCheckUtils]: 66: Hoare triple {17992#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,460 INFO L290 TraceCheckUtils]: 67: Hoare triple {17992#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,460 INFO L290 TraceCheckUtils]: 68: Hoare triple {17992#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,460 INFO L290 TraceCheckUtils]: 69: Hoare triple {17992#false} assume 8448 == #t~mem63;havoc #t~mem63; {17992#false} is VALID [2022-04-27 15:26:14,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {17992#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {17992#false} is VALID [2022-04-27 15:26:14,460 INFO L290 TraceCheckUtils]: 71: Hoare triple {17992#false} assume !(~num1~0 > 0); {17992#false} is VALID [2022-04-27 15:26:14,460 INFO L290 TraceCheckUtils]: 72: Hoare triple {17992#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {17992#false} is VALID [2022-04-27 15:26:14,460 INFO L290 TraceCheckUtils]: 73: Hoare triple {17992#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,460 INFO L290 TraceCheckUtils]: 74: Hoare triple {17992#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {17992#false} is VALID [2022-04-27 15:26:14,460 INFO L290 TraceCheckUtils]: 75: Hoare triple {17992#false} ~skip~0 := 0; {17992#false} is VALID [2022-04-27 15:26:14,460 INFO L290 TraceCheckUtils]: 76: Hoare triple {17992#false} assume !false; {17992#false} is VALID [2022-04-27 15:26:14,460 INFO L290 TraceCheckUtils]: 77: Hoare triple {17992#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,460 INFO L290 TraceCheckUtils]: 78: Hoare triple {17992#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,461 INFO L290 TraceCheckUtils]: 79: Hoare triple {17992#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,461 INFO L290 TraceCheckUtils]: 80: Hoare triple {17992#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,461 INFO L290 TraceCheckUtils]: 81: Hoare triple {17992#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,461 INFO L290 TraceCheckUtils]: 82: Hoare triple {17992#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,461 INFO L290 TraceCheckUtils]: 83: Hoare triple {17992#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,461 INFO L290 TraceCheckUtils]: 84: Hoare triple {17992#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,461 INFO L290 TraceCheckUtils]: 85: Hoare triple {17992#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,461 INFO L290 TraceCheckUtils]: 86: Hoare triple {17992#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,461 INFO L290 TraceCheckUtils]: 87: Hoare triple {17992#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,461 INFO L290 TraceCheckUtils]: 88: Hoare triple {17992#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,461 INFO L290 TraceCheckUtils]: 89: Hoare triple {17992#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,461 INFO L290 TraceCheckUtils]: 90: Hoare triple {17992#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,461 INFO L290 TraceCheckUtils]: 91: Hoare triple {17992#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,465 INFO L290 TraceCheckUtils]: 92: Hoare triple {17992#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,465 INFO L290 TraceCheckUtils]: 93: Hoare triple {17992#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,465 INFO L290 TraceCheckUtils]: 94: Hoare triple {17992#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,466 INFO L290 TraceCheckUtils]: 95: Hoare triple {17992#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,466 INFO L290 TraceCheckUtils]: 96: Hoare triple {17992#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,466 INFO L290 TraceCheckUtils]: 97: Hoare triple {17992#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,466 INFO L290 TraceCheckUtils]: 98: Hoare triple {17992#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,466 INFO L290 TraceCheckUtils]: 99: Hoare triple {17992#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,466 INFO L290 TraceCheckUtils]: 100: Hoare triple {17992#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,466 INFO L290 TraceCheckUtils]: 101: Hoare triple {17992#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,466 INFO L290 TraceCheckUtils]: 102: Hoare triple {17992#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,466 INFO L290 TraceCheckUtils]: 103: Hoare triple {17992#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,466 INFO L290 TraceCheckUtils]: 104: Hoare triple {17992#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,466 INFO L290 TraceCheckUtils]: 105: Hoare triple {17992#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,466 INFO L290 TraceCheckUtils]: 106: Hoare triple {17992#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,466 INFO L290 TraceCheckUtils]: 107: Hoare triple {17992#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,467 INFO L290 TraceCheckUtils]: 108: Hoare triple {17992#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,467 INFO L290 TraceCheckUtils]: 109: Hoare triple {17992#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-27 15:26:14,467 INFO L290 TraceCheckUtils]: 110: Hoare triple {17992#false} assume 8672 == #t~mem74;havoc #t~mem74; {17992#false} is VALID [2022-04-27 15:26:14,467 INFO L290 TraceCheckUtils]: 111: Hoare triple {17992#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {17992#false} is VALID [2022-04-27 15:26:14,467 INFO L290 TraceCheckUtils]: 112: Hoare triple {17992#false} assume 4 == ~blastFlag~0; {17992#false} is VALID [2022-04-27 15:26:14,467 INFO L290 TraceCheckUtils]: 113: Hoare triple {17992#false} assume !false; {17992#false} is VALID [2022-04-27 15:26:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 15:26:14,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:14,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873393026] [2022-04-27 15:26:14,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873393026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:14,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:14,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:14,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072881154] [2022-04-27 15:26:14,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:14,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-27 15:26:14,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:14,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:14,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:14,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:14,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:14,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:14,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:14,595 INFO L87 Difference]: Start difference. First operand 273 states and 425 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:16,612 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-27 15:26:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:17,541 INFO L93 Difference]: Finished difference Result 533 states and 836 transitions. [2022-04-27 15:26:17,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:17,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-27 15:26:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2022-04-27 15:26:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2022-04-27 15:26:17,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 438 transitions. [2022-04-27 15:26:17,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 438 edges. 438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:17,850 INFO L225 Difference]: With dead ends: 533 [2022-04-27 15:26:17,850 INFO L226 Difference]: Without dead ends: 286 [2022-04-27 15:26:17,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:17,851 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 20 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:17,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 549 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:26:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-04-27 15:26:17,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2022-04-27 15:26:17,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:17,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand has 273 states, 268 states have (on average 1.5671641791044777) internal successors, (420), 268 states have internal predecessors, (420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:17,860 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand has 273 states, 268 states have (on average 1.5671641791044777) internal successors, (420), 268 states have internal predecessors, (420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:17,860 INFO L87 Difference]: Start difference. First operand 286 states. Second operand has 273 states, 268 states have (on average 1.5671641791044777) internal successors, (420), 268 states have internal predecessors, (420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:17,865 INFO L93 Difference]: Finished difference Result 286 states and 440 transitions. [2022-04-27 15:26:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 440 transitions. [2022-04-27 15:26:17,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:17,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:17,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 268 states have (on average 1.5671641791044777) internal successors, (420), 268 states have internal predecessors, (420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 286 states. [2022-04-27 15:26:17,866 INFO L87 Difference]: Start difference. First operand has 273 states, 268 states have (on average 1.5671641791044777) internal successors, (420), 268 states have internal predecessors, (420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 286 states. [2022-04-27 15:26:17,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:17,870 INFO L93 Difference]: Finished difference Result 286 states and 440 transitions. [2022-04-27 15:26:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 440 transitions. [2022-04-27 15:26:17,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:17,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:17,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:17,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.5671641791044777) internal successors, (420), 268 states have internal predecessors, (420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 424 transitions. [2022-04-27 15:26:17,887 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 424 transitions. Word has length 114 [2022-04-27 15:26:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:17,887 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 424 transitions. [2022-04-27 15:26:17,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 424 transitions. [2022-04-27 15:26:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-27 15:26:17,890 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:17,890 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:26:17,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:26:17,891 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash -98519058, now seen corresponding path program 1 times [2022-04-27 15:26:17,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:17,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004941454] [2022-04-27 15:26:17,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:17,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:18,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:18,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {19499#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {19491#true} is VALID [2022-04-27 15:26:18,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {19491#true} assume true; {19491#true} is VALID [2022-04-27 15:26:18,042 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19491#true} {19491#true} #664#return; {19491#true} is VALID [2022-04-27 15:26:18,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {19491#true} call ULTIMATE.init(); {19499#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:18,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {19499#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {19491#true} is VALID [2022-04-27 15:26:18,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {19491#true} assume true; {19491#true} is VALID [2022-04-27 15:26:18,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19491#true} {19491#true} #664#return; {19491#true} is VALID [2022-04-27 15:26:18,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {19491#true} call #t~ret162 := main(); {19491#true} is VALID [2022-04-27 15:26:18,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {19491#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {19491#true} is VALID [2022-04-27 15:26:18,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {19491#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {19491#true} is VALID [2022-04-27 15:26:18,043 INFO L272 TraceCheckUtils]: 7: Hoare triple {19491#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19491#true} is VALID [2022-04-27 15:26:18,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {19491#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {19491#true} is VALID [2022-04-27 15:26:18,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {19491#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {19491#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {19491#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {19491#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {19491#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {19491#true} assume !false; {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {19491#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {19491#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {19491#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {19491#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {19491#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {19491#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {19491#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {19491#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {19491#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {19491#true} assume 8464 == #t~mem50;havoc #t~mem50; {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {19491#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {19491#true} is VALID [2022-04-27 15:26:18,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {19491#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19491#true} is VALID [2022-04-27 15:26:18,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {19491#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {19491#true} is VALID [2022-04-27 15:26:18,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {19491#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {19491#true} is VALID [2022-04-27 15:26:18,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {19491#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {19491#true} is VALID [2022-04-27 15:26:18,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {19491#true} ~skip~0 := 0; {19491#true} is VALID [2022-04-27 15:26:18,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {19491#true} assume !false; {19491#true} is VALID [2022-04-27 15:26:18,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {19491#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {19496#(= |ssl3_accept_#t~mem42| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:18,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {19496#(= |ssl3_accept_#t~mem42| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem42;havoc #t~mem42; {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:18,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:18,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:18,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:18,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:18,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:18,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:18,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:18,050 INFO L290 TraceCheckUtils]: 41: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {19498#(= 12292 |ssl3_accept_#t~mem81|)} is VALID [2022-04-27 15:26:18,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {19498#(= 12292 |ssl3_accept_#t~mem81|)} assume 12292 != #t~mem81;havoc #t~mem81;assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {19492#false} is VALID [2022-04-27 15:26:18,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {19492#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 72 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 72 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {19492#false} is VALID [2022-04-27 15:26:18,050 INFO L290 TraceCheckUtils]: 44: Hoare triple {19492#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {19492#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {19492#false} is VALID [2022-04-27 15:26:18,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {19492#false} ~skip~0 := 0; {19492#false} is VALID [2022-04-27 15:26:18,050 INFO L290 TraceCheckUtils]: 47: Hoare triple {19492#false} assume !false; {19492#false} is VALID [2022-04-27 15:26:18,050 INFO L290 TraceCheckUtils]: 48: Hoare triple {19492#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {19492#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,050 INFO L290 TraceCheckUtils]: 50: Hoare triple {19492#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 51: Hoare triple {19492#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 52: Hoare triple {19492#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 53: Hoare triple {19492#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 54: Hoare triple {19492#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 55: Hoare triple {19492#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 56: Hoare triple {19492#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 57: Hoare triple {19492#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 58: Hoare triple {19492#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 59: Hoare triple {19492#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 60: Hoare triple {19492#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 61: Hoare triple {19492#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 62: Hoare triple {19492#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 63: Hoare triple {19492#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 64: Hoare triple {19492#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 65: Hoare triple {19492#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 66: Hoare triple {19492#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,051 INFO L290 TraceCheckUtils]: 67: Hoare triple {19492#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 68: Hoare triple {19492#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 69: Hoare triple {19492#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 70: Hoare triple {19492#false} assume 8448 == #t~mem63;havoc #t~mem63; {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 71: Hoare triple {19492#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 72: Hoare triple {19492#false} assume !(~num1~0 > 0); {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 73: Hoare triple {19492#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 74: Hoare triple {19492#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 75: Hoare triple {19492#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 76: Hoare triple {19492#false} ~skip~0 := 0; {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 77: Hoare triple {19492#false} assume !false; {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 78: Hoare triple {19492#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 79: Hoare triple {19492#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 80: Hoare triple {19492#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 81: Hoare triple {19492#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 82: Hoare triple {19492#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 83: Hoare triple {19492#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,052 INFO L290 TraceCheckUtils]: 84: Hoare triple {19492#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 85: Hoare triple {19492#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 86: Hoare triple {19492#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 87: Hoare triple {19492#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 88: Hoare triple {19492#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 89: Hoare triple {19492#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 90: Hoare triple {19492#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 91: Hoare triple {19492#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 92: Hoare triple {19492#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 93: Hoare triple {19492#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 94: Hoare triple {19492#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 95: Hoare triple {19492#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 96: Hoare triple {19492#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 97: Hoare triple {19492#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 98: Hoare triple {19492#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 99: Hoare triple {19492#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 100: Hoare triple {19492#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 101: Hoare triple {19492#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,053 INFO L290 TraceCheckUtils]: 102: Hoare triple {19492#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,054 INFO L290 TraceCheckUtils]: 103: Hoare triple {19492#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,054 INFO L290 TraceCheckUtils]: 104: Hoare triple {19492#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,054 INFO L290 TraceCheckUtils]: 105: Hoare triple {19492#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,054 INFO L290 TraceCheckUtils]: 106: Hoare triple {19492#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,054 INFO L290 TraceCheckUtils]: 107: Hoare triple {19492#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,054 INFO L290 TraceCheckUtils]: 108: Hoare triple {19492#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,054 INFO L290 TraceCheckUtils]: 109: Hoare triple {19492#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,054 INFO L290 TraceCheckUtils]: 110: Hoare triple {19492#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-27 15:26:18,054 INFO L290 TraceCheckUtils]: 111: Hoare triple {19492#false} assume 8672 == #t~mem74;havoc #t~mem74; {19492#false} is VALID [2022-04-27 15:26:18,054 INFO L290 TraceCheckUtils]: 112: Hoare triple {19492#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {19492#false} is VALID [2022-04-27 15:26:18,054 INFO L290 TraceCheckUtils]: 113: Hoare triple {19492#false} assume 4 == ~blastFlag~0; {19492#false} is VALID [2022-04-27 15:26:18,054 INFO L290 TraceCheckUtils]: 114: Hoare triple {19492#false} assume !false; {19492#false} is VALID [2022-04-27 15:26:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-27 15:26:18,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:18,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004941454] [2022-04-27 15:26:18,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004941454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:18,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:18,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 15:26:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988142278] [2022-04-27 15:26:18,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:18,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-27 15:26:18,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:18,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:18,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:18,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 15:26:18,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:18,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 15:26:18,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:18,130 INFO L87 Difference]: Start difference. First operand 273 states and 424 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:20,156 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-27 15:26:21,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:21,157 INFO L93 Difference]: Finished difference Result 529 states and 830 transitions. [2022-04-27 15:26:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 15:26:21,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-27 15:26:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 409 transitions. [2022-04-27 15:26:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 409 transitions. [2022-04-27 15:26:21,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 409 transitions. [2022-04-27 15:26:21,382 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-27 15:26:21,386 INFO L225 Difference]: With dead ends: 529 [2022-04-27 15:26:21,386 INFO L226 Difference]: Without dead ends: 282 [2022-04-27 15:26:21,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:26:21,387 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 2 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:21,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 605 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 424 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:26:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-04-27 15:26:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-04-27 15:26:21,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:21,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 282 states, 277 states have (on average 1.555956678700361) internal successors, (431), 277 states have internal predecessors, (431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:21,393 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 282 states, 277 states have (on average 1.555956678700361) internal successors, (431), 277 states have internal predecessors, (431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:21,393 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 282 states, 277 states have (on average 1.555956678700361) internal successors, (431), 277 states have internal predecessors, (431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:21,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:21,397 INFO L93 Difference]: Finished difference Result 282 states and 435 transitions. [2022-04-27 15:26:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 435 transitions. [2022-04-27 15:26:21,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:21,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:21,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 282 states, 277 states have (on average 1.555956678700361) internal successors, (431), 277 states have internal predecessors, (431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 282 states. [2022-04-27 15:26:21,398 INFO L87 Difference]: Start difference. First operand has 282 states, 277 states have (on average 1.555956678700361) internal successors, (431), 277 states have internal predecessors, (431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 282 states. [2022-04-27 15:26:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:21,402 INFO L93 Difference]: Finished difference Result 282 states and 435 transitions. [2022-04-27 15:26:21,402 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 435 transitions. [2022-04-27 15:26:21,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:21,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:21,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:21,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 277 states have (on average 1.555956678700361) internal successors, (431), 277 states have internal predecessors, (431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 435 transitions. [2022-04-27 15:26:21,419 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 435 transitions. Word has length 115 [2022-04-27 15:26:21,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:21,420 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 435 transitions. [2022-04-27 15:26:21,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 435 transitions. [2022-04-27 15:26:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-27 15:26:21,421 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:21,422 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:26:21,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:26:21,422 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:21,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:21,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2075689295, now seen corresponding path program 1 times [2022-04-27 15:26:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:21,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406374449] [2022-04-27 15:26:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:21,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:21,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {20995#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {20988#true} is VALID [2022-04-27 15:26:21,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {20988#true} assume true; {20988#true} is VALID [2022-04-27 15:26:21,533 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20988#true} {20988#true} #664#return; {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {20988#true} call ULTIMATE.init(); {20995#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:21,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {20995#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {20988#true} assume true; {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20988#true} {20988#true} #664#return; {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {20988#true} call #t~ret162 := main(); {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {20988#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {20988#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L272 TraceCheckUtils]: 7: Hoare triple {20988#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {20988#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {20988#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {20988#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {20988#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {20988#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {20988#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {20988#true} assume !false; {20988#true} is VALID [2022-04-27 15:26:21,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {20988#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-27 15:26:21,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {20988#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-27 15:26:21,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {20988#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-27 15:26:21,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {20988#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-27 15:26:21,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {20988#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-27 15:26:21,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {20988#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-27 15:26:21,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {20988#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-27 15:26:21,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {20988#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-27 15:26:21,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {20988#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-27 15:26:21,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {20988#true} assume 8464 == #t~mem50;havoc #t~mem50; {20988#true} is VALID [2022-04-27 15:26:21,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {20988#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {20988#true} is VALID [2022-04-27 15:26:21,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {20988#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20988#true} is VALID [2022-04-27 15:26:21,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {20988#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {20994#(= |ssl3_accept_#t~mem44| 8496)} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {20994#(= |ssl3_accept_#t~mem44| 8496)} assume 8192 == #t~mem44;havoc #t~mem44; {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {20989#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {20989#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {20989#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {20989#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {20989#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {20989#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {20989#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {20989#false} assume 12292 != #t~mem81;havoc #t~mem81;assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {20989#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 72 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 72 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {20989#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {20989#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {20989#false} ~skip~0 := 0; {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {20989#false} assume !false; {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {20989#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {20989#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {20989#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,540 INFO L290 TraceCheckUtils]: 52: Hoare triple {20989#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {20989#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,540 INFO L290 TraceCheckUtils]: 54: Hoare triple {20989#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,551 INFO L290 TraceCheckUtils]: 55: Hoare triple {20989#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,551 INFO L290 TraceCheckUtils]: 56: Hoare triple {20989#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,551 INFO L290 TraceCheckUtils]: 57: Hoare triple {20989#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,551 INFO L290 TraceCheckUtils]: 58: Hoare triple {20989#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,551 INFO L290 TraceCheckUtils]: 59: Hoare triple {20989#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 60: Hoare triple {20989#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {20989#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {20989#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {20989#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 64: Hoare triple {20989#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 65: Hoare triple {20989#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {20989#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 67: Hoare triple {20989#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 68: Hoare triple {20989#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 69: Hoare triple {20989#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 70: Hoare triple {20989#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {20989#false} assume 8448 == #t~mem63;havoc #t~mem63; {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 72: Hoare triple {20989#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 73: Hoare triple {20989#false} assume !(~num1~0 > 0); {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 74: Hoare triple {20989#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 75: Hoare triple {20989#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,552 INFO L290 TraceCheckUtils]: 76: Hoare triple {20989#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 77: Hoare triple {20989#false} ~skip~0 := 0; {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 78: Hoare triple {20989#false} assume !false; {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 79: Hoare triple {20989#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 80: Hoare triple {20989#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 81: Hoare triple {20989#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 82: Hoare triple {20989#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 83: Hoare triple {20989#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 84: Hoare triple {20989#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 85: Hoare triple {20989#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 86: Hoare triple {20989#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 87: Hoare triple {20989#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 88: Hoare triple {20989#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 89: Hoare triple {20989#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 90: Hoare triple {20989#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 91: Hoare triple {20989#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 92: Hoare triple {20989#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,553 INFO L290 TraceCheckUtils]: 93: Hoare triple {20989#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 94: Hoare triple {20989#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 95: Hoare triple {20989#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 96: Hoare triple {20989#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 97: Hoare triple {20989#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 98: Hoare triple {20989#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 99: Hoare triple {20989#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 100: Hoare triple {20989#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 101: Hoare triple {20989#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 102: Hoare triple {20989#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 103: Hoare triple {20989#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 104: Hoare triple {20989#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 105: Hoare triple {20989#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 106: Hoare triple {20989#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 107: Hoare triple {20989#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 108: Hoare triple {20989#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 109: Hoare triple {20989#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,554 INFO L290 TraceCheckUtils]: 110: Hoare triple {20989#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,555 INFO L290 TraceCheckUtils]: 111: Hoare triple {20989#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-27 15:26:21,555 INFO L290 TraceCheckUtils]: 112: Hoare triple {20989#false} assume 8672 == #t~mem74;havoc #t~mem74; {20989#false} is VALID [2022-04-27 15:26:21,555 INFO L290 TraceCheckUtils]: 113: Hoare triple {20989#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {20989#false} is VALID [2022-04-27 15:26:21,555 INFO L290 TraceCheckUtils]: 114: Hoare triple {20989#false} assume 4 == ~blastFlag~0; {20989#false} is VALID [2022-04-27 15:26:21,555 INFO L290 TraceCheckUtils]: 115: Hoare triple {20989#false} assume !false; {20989#false} is VALID [2022-04-27 15:26:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 15:26:21,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:21,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406374449] [2022-04-27 15:26:21,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406374449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:21,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:21,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:21,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190222813] [2022-04-27 15:26:21,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:21,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-27 15:26:21,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:21,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:21,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:21,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:21,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:21,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:21,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:21,626 INFO L87 Difference]: Start difference. First operand 282 states and 435 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:23,656 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:26:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:24,568 INFO L93 Difference]: Finished difference Result 565 states and 875 transitions. [2022-04-27 15:26:24,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:24,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-27 15:26:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2022-04-27 15:26:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2022-04-27 15:26:24,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 454 transitions. [2022-04-27 15:26:24,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:24,873 INFO L225 Difference]: With dead ends: 565 [2022-04-27 15:26:24,874 INFO L226 Difference]: Without dead ends: 309 [2022-04-27 15:26:24,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:24,874 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 37 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:24,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 488 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 380 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:26:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-27 15:26:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 282. [2022-04-27 15:26:24,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:24,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 282 states, 277 states have (on average 1.552346570397112) internal successors, (430), 277 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:24,880 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 282 states, 277 states have (on average 1.552346570397112) internal successors, (430), 277 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:24,880 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 282 states, 277 states have (on average 1.552346570397112) internal successors, (430), 277 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:24,884 INFO L93 Difference]: Finished difference Result 309 states and 469 transitions. [2022-04-27 15:26:24,884 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 469 transitions. [2022-04-27 15:26:24,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:24,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:24,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 282 states, 277 states have (on average 1.552346570397112) internal successors, (430), 277 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 309 states. [2022-04-27 15:26:24,885 INFO L87 Difference]: Start difference. First operand has 282 states, 277 states have (on average 1.552346570397112) internal successors, (430), 277 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 309 states. [2022-04-27 15:26:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:24,889 INFO L93 Difference]: Finished difference Result 309 states and 469 transitions. [2022-04-27 15:26:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 469 transitions. [2022-04-27 15:26:24,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:24,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:24,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:24,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 277 states have (on average 1.552346570397112) internal successors, (430), 277 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 434 transitions. [2022-04-27 15:26:24,894 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 434 transitions. Word has length 116 [2022-04-27 15:26:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:24,894 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 434 transitions. [2022-04-27 15:26:24,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 434 transitions. [2022-04-27 15:26:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-27 15:26:24,895 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:24,895 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:26:24,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:26:24,895 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:24,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:24,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1112626983, now seen corresponding path program 1 times [2022-04-27 15:26:24,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:24,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742177847] [2022-04-27 15:26:24,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:24,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:25,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:25,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {22587#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {22580#true} is VALID [2022-04-27 15:26:25,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {22580#true} assume true; {22580#true} is VALID [2022-04-27 15:26:25,013 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22580#true} {22580#true} #664#return; {22580#true} is VALID [2022-04-27 15:26:25,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {22580#true} call ULTIMATE.init(); {22587#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:25,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {22587#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {22580#true} is VALID [2022-04-27 15:26:25,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {22580#true} assume true; {22580#true} is VALID [2022-04-27 15:26:25,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22580#true} {22580#true} #664#return; {22580#true} is VALID [2022-04-27 15:26:25,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {22580#true} call #t~ret162 := main(); {22580#true} is VALID [2022-04-27 15:26:25,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {22580#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {22580#true} is VALID [2022-04-27 15:26:25,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {22580#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22580#true} is VALID [2022-04-27 15:26:25,014 INFO L272 TraceCheckUtils]: 7: Hoare triple {22580#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22580#true} is VALID [2022-04-27 15:26:25,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {22580#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {22580#true} is VALID [2022-04-27 15:26:25,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {22580#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {22580#true} is VALID [2022-04-27 15:26:25,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {22580#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {22580#true} is VALID [2022-04-27 15:26:25,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {22580#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {22580#true} is VALID [2022-04-27 15:26:25,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {22580#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22580#true} is VALID [2022-04-27 15:26:25,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {22580#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {22580#true} is VALID [2022-04-27 15:26:25,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {22580#true} assume !false; {22580#true} is VALID [2022-04-27 15:26:25,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {22580#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-27 15:26:25,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {22580#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-27 15:26:25,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {22580#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-27 15:26:25,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {22580#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-27 15:26:25,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {22580#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-27 15:26:25,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {22580#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-27 15:26:25,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {22580#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-27 15:26:25,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {22580#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-27 15:26:25,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {22580#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-27 15:26:25,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {22580#true} assume 8464 == #t~mem50;havoc #t~mem50; {22580#true} is VALID [2022-04-27 15:26:25,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {22580#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {22580#true} is VALID [2022-04-27 15:26:25,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {22580#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {22580#true} is VALID [2022-04-27 15:26:25,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {22580#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:25,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:25,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:25,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:25,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:25,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:25,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:25,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:25,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {22586#(= |ssl3_accept_#t~mem45| 8496)} is VALID [2022-04-27 15:26:25,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {22586#(= |ssl3_accept_#t~mem45| 8496)} assume 24576 == #t~mem45;havoc #t~mem45; {22581#false} is VALID [2022-04-27 15:26:25,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {22581#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {22581#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {22581#false} is VALID [2022-04-27 15:26:25,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {22581#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {22581#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {22581#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {22581#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {22581#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {22581#false} assume 12292 != #t~mem81;havoc #t~mem81;assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 45: Hoare triple {22581#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 72 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 72 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 46: Hoare triple {22581#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 47: Hoare triple {22581#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 48: Hoare triple {22581#false} ~skip~0 := 0; {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 49: Hoare triple {22581#false} assume !false; {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 50: Hoare triple {22581#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 51: Hoare triple {22581#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 52: Hoare triple {22581#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 53: Hoare triple {22581#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 54: Hoare triple {22581#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 55: Hoare triple {22581#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 56: Hoare triple {22581#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,020 INFO L290 TraceCheckUtils]: 57: Hoare triple {22581#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 58: Hoare triple {22581#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 59: Hoare triple {22581#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 60: Hoare triple {22581#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 61: Hoare triple {22581#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {22581#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {22581#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 64: Hoare triple {22581#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 65: Hoare triple {22581#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 66: Hoare triple {22581#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 67: Hoare triple {22581#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 68: Hoare triple {22581#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 69: Hoare triple {22581#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 70: Hoare triple {22581#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 71: Hoare triple {22581#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 72: Hoare triple {22581#false} assume 8448 == #t~mem63;havoc #t~mem63; {22581#false} is VALID [2022-04-27 15:26:25,021 INFO L290 TraceCheckUtils]: 73: Hoare triple {22581#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 74: Hoare triple {22581#false} assume !(~num1~0 > 0); {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 75: Hoare triple {22581#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 76: Hoare triple {22581#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 77: Hoare triple {22581#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 78: Hoare triple {22581#false} ~skip~0 := 0; {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 79: Hoare triple {22581#false} assume !false; {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 80: Hoare triple {22581#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 81: Hoare triple {22581#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 82: Hoare triple {22581#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 83: Hoare triple {22581#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 84: Hoare triple {22581#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 85: Hoare triple {22581#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 86: Hoare triple {22581#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 87: Hoare triple {22581#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 88: Hoare triple {22581#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 89: Hoare triple {22581#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,022 INFO L290 TraceCheckUtils]: 90: Hoare triple {22581#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 91: Hoare triple {22581#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 92: Hoare triple {22581#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 93: Hoare triple {22581#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 94: Hoare triple {22581#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 95: Hoare triple {22581#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 96: Hoare triple {22581#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 97: Hoare triple {22581#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 98: Hoare triple {22581#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 99: Hoare triple {22581#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 100: Hoare triple {22581#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 101: Hoare triple {22581#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 102: Hoare triple {22581#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 103: Hoare triple {22581#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 104: Hoare triple {22581#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 105: Hoare triple {22581#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,023 INFO L290 TraceCheckUtils]: 106: Hoare triple {22581#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,024 INFO L290 TraceCheckUtils]: 107: Hoare triple {22581#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,024 INFO L290 TraceCheckUtils]: 108: Hoare triple {22581#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,024 INFO L290 TraceCheckUtils]: 109: Hoare triple {22581#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,024 INFO L290 TraceCheckUtils]: 110: Hoare triple {22581#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,024 INFO L290 TraceCheckUtils]: 111: Hoare triple {22581#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,024 INFO L290 TraceCheckUtils]: 112: Hoare triple {22581#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-27 15:26:25,024 INFO L290 TraceCheckUtils]: 113: Hoare triple {22581#false} assume 8672 == #t~mem74;havoc #t~mem74; {22581#false} is VALID [2022-04-27 15:26:25,024 INFO L290 TraceCheckUtils]: 114: Hoare triple {22581#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {22581#false} is VALID [2022-04-27 15:26:25,024 INFO L290 TraceCheckUtils]: 115: Hoare triple {22581#false} assume 4 == ~blastFlag~0; {22581#false} is VALID [2022-04-27 15:26:25,024 INFO L290 TraceCheckUtils]: 116: Hoare triple {22581#false} assume !false; {22581#false} is VALID [2022-04-27 15:26:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 15:26:25,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:25,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742177847] [2022-04-27 15:26:25,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742177847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:25,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:25,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:25,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536136019] [2022-04-27 15:26:25,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:25,025 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 117 [2022-04-27 15:26:25,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:25,025 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-27 15:26:25,089 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-27 15:26:25,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:25,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:25,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:25,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:25,091 INFO L87 Difference]: Start difference. First operand 282 states and 434 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-27 15:26:27,110 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-27 15:26:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:28,059 INFO L93 Difference]: Finished difference Result 555 states and 860 transitions. [2022-04-27 15:26:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:28,059 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 117 [2022-04-27 15:26:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:28,059 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-27 15:26:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-27 15:26:28,061 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-27 15:26:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-27 15:26:28,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-27 15:26:28,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:28,361 INFO L225 Difference]: With dead ends: 555 [2022-04-27 15:26:28,361 INFO L226 Difference]: Without dead ends: 299 [2022-04-27 15:26:28,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:28,362 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 34 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:28,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 490 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 378 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:26:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-27 15:26:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 282. [2022-04-27 15:26:28,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:28,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 282 states, 277 states have (on average 1.5487364620938628) internal successors, (429), 277 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:28,367 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 282 states, 277 states have (on average 1.5487364620938628) internal successors, (429), 277 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:28,367 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 282 states, 277 states have (on average 1.5487364620938628) internal successors, (429), 277 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:28,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:28,371 INFO L93 Difference]: Finished difference Result 299 states and 455 transitions. [2022-04-27 15:26:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 455 transitions. [2022-04-27 15:26:28,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:28,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:28,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 282 states, 277 states have (on average 1.5487364620938628) internal successors, (429), 277 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 299 states. [2022-04-27 15:26:28,373 INFO L87 Difference]: Start difference. First operand has 282 states, 277 states have (on average 1.5487364620938628) internal successors, (429), 277 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 299 states. [2022-04-27 15:26:28,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:28,376 INFO L93 Difference]: Finished difference Result 299 states and 455 transitions. [2022-04-27 15:26:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 455 transitions. [2022-04-27 15:26:28,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:28,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:28,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:28,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 277 states have (on average 1.5487364620938628) internal successors, (429), 277 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 433 transitions. [2022-04-27 15:26:28,380 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 433 transitions. Word has length 117 [2022-04-27 15:26:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:28,381 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 433 transitions. [2022-04-27 15:26:28,381 INFO L496 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-27 15:26:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 433 transitions. [2022-04-27 15:26:28,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-27 15:26:28,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:28,382 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:28,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:26:28,382 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:28,382 INFO L85 PathProgramCache]: Analyzing trace with hash 502133768, now seen corresponding path program 1 times [2022-04-27 15:26:28,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:28,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744471525] [2022-04-27 15:26:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:28,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:28,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:28,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {24148#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {24141#true} is VALID [2022-04-27 15:26:28,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {24141#true} assume true; {24141#true} is VALID [2022-04-27 15:26:28,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24141#true} {24141#true} #664#return; {24141#true} is VALID [2022-04-27 15:26:28,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {24141#true} call ULTIMATE.init(); {24148#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:28,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {24148#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {24141#true} is VALID [2022-04-27 15:26:28,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {24141#true} assume true; {24141#true} is VALID [2022-04-27 15:26:28,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24141#true} {24141#true} #664#return; {24141#true} is VALID [2022-04-27 15:26:28,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {24141#true} call #t~ret162 := main(); {24141#true} is VALID [2022-04-27 15:26:28,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {24141#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {24141#true} is VALID [2022-04-27 15:26:28,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {24141#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,497 INFO L272 TraceCheckUtils]: 7: Hoare triple {24141#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {24141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {24141#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {24141#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {24141#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {24141#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {24141#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {24141#true} assume !false; {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {24141#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {24141#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {24141#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {24141#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {24141#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {24141#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {24141#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {24141#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {24141#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {24141#true} assume 8464 == #t~mem50;havoc #t~mem50; {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {24141#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {24141#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {24141#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {24141#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {24141#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {24141#true} ~skip~0 := 0; {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {24141#true} assume !false; {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {24141#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {24141#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {24141#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {24141#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {24141#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {24141#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {24141#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {24141#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {24141#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {24141#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {24141#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {24141#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {24141#true} assume 8496 == #t~mem53;havoc #t~mem53; {24141#true} is VALID [2022-04-27 15:26:28,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {24141#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {24141#true} is VALID [2022-04-27 15:26:28,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {24141#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {24141#true} is VALID [2022-04-27 15:26:28,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {24141#true} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 92 + ~s.offset, 4); {24141#true} is VALID [2022-04-27 15:26:28,501 INFO L290 TraceCheckUtils]: 48: Hoare triple {24141#true} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,503 INFO L290 TraceCheckUtils]: 54: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,503 INFO L290 TraceCheckUtils]: 55: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,503 INFO L290 TraceCheckUtils]: 56: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,504 INFO L290 TraceCheckUtils]: 57: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,504 INFO L290 TraceCheckUtils]: 58: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,504 INFO L290 TraceCheckUtils]: 59: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,505 INFO L290 TraceCheckUtils]: 62: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,506 INFO L290 TraceCheckUtils]: 63: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,507 INFO L290 TraceCheckUtils]: 66: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,507 INFO L290 TraceCheckUtils]: 67: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,507 INFO L290 TraceCheckUtils]: 68: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,508 INFO L290 TraceCheckUtils]: 69: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,508 INFO L290 TraceCheckUtils]: 70: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,508 INFO L290 TraceCheckUtils]: 71: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,509 INFO L290 TraceCheckUtils]: 72: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,509 INFO L290 TraceCheckUtils]: 73: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,509 INFO L290 TraceCheckUtils]: 74: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:28,510 INFO L290 TraceCheckUtils]: 75: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24147#(not (= 8448 |ssl3_accept_#t~mem63|))} is VALID [2022-04-27 15:26:28,510 INFO L290 TraceCheckUtils]: 76: Hoare triple {24147#(not (= 8448 |ssl3_accept_#t~mem63|))} assume 8448 == #t~mem63;havoc #t~mem63; {24142#false} is VALID [2022-04-27 15:26:28,510 INFO L290 TraceCheckUtils]: 77: Hoare triple {24142#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {24142#false} is VALID [2022-04-27 15:26:28,510 INFO L290 TraceCheckUtils]: 78: Hoare triple {24142#false} assume !(~num1~0 > 0); {24142#false} is VALID [2022-04-27 15:26:28,510 INFO L290 TraceCheckUtils]: 79: Hoare triple {24142#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {24142#false} is VALID [2022-04-27 15:26:28,510 INFO L290 TraceCheckUtils]: 80: Hoare triple {24142#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,510 INFO L290 TraceCheckUtils]: 81: Hoare triple {24142#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {24142#false} is VALID [2022-04-27 15:26:28,510 INFO L290 TraceCheckUtils]: 82: Hoare triple {24142#false} ~skip~0 := 0; {24142#false} is VALID [2022-04-27 15:26:28,510 INFO L290 TraceCheckUtils]: 83: Hoare triple {24142#false} assume !false; {24142#false} is VALID [2022-04-27 15:26:28,510 INFO L290 TraceCheckUtils]: 84: Hoare triple {24142#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,510 INFO L290 TraceCheckUtils]: 85: Hoare triple {24142#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 86: Hoare triple {24142#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 87: Hoare triple {24142#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 88: Hoare triple {24142#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 89: Hoare triple {24142#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 90: Hoare triple {24142#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 91: Hoare triple {24142#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 92: Hoare triple {24142#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 93: Hoare triple {24142#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 94: Hoare triple {24142#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 95: Hoare triple {24142#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 96: Hoare triple {24142#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 97: Hoare triple {24142#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 98: Hoare triple {24142#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 99: Hoare triple {24142#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 100: Hoare triple {24142#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 101: Hoare triple {24142#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 102: Hoare triple {24142#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,511 INFO L290 TraceCheckUtils]: 103: Hoare triple {24142#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 104: Hoare triple {24142#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 105: Hoare triple {24142#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 106: Hoare triple {24142#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 107: Hoare triple {24142#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 108: Hoare triple {24142#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 109: Hoare triple {24142#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 110: Hoare triple {24142#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 111: Hoare triple {24142#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 112: Hoare triple {24142#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 113: Hoare triple {24142#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 114: Hoare triple {24142#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 115: Hoare triple {24142#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 116: Hoare triple {24142#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 117: Hoare triple {24142#false} assume 8672 == #t~mem74;havoc #t~mem74; {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 118: Hoare triple {24142#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 119: Hoare triple {24142#false} assume 4 == ~blastFlag~0; {24142#false} is VALID [2022-04-27 15:26:28,512 INFO L290 TraceCheckUtils]: 120: Hoare triple {24142#false} assume !false; {24142#false} is VALID [2022-04-27 15:26:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:26:28,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:28,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744471525] [2022-04-27 15:26:28,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744471525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:28,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:28,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:28,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193870375] [2022-04-27 15:26:28,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:28,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-27 15:26:28,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:28,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:28,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:28,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:28,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:28,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:28,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:28,592 INFO L87 Difference]: Start difference. First operand 282 states and 433 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:30,612 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-27 15:26:31,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:31,741 INFO L93 Difference]: Finished difference Result 656 states and 1011 transitions. [2022-04-27 15:26:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:31,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-27 15:26:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-27 15:26:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-27 15:26:31,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 564 transitions. [2022-04-27 15:26:32,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:32,089 INFO L225 Difference]: With dead ends: 656 [2022-04-27 15:26:32,089 INFO L226 Difference]: Without dead ends: 400 [2022-04-27 15:26:32,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:32,090 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 117 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:32,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 355 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:26:32,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-04-27 15:26:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 314. [2022-04-27 15:26:32,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:32,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 400 states. Second operand has 314 states, 309 states have (on average 1.5566343042071198) internal successors, (481), 309 states have internal predecessors, (481), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:32,097 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand has 314 states, 309 states have (on average 1.5566343042071198) internal successors, (481), 309 states have internal predecessors, (481), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:32,097 INFO L87 Difference]: Start difference. First operand 400 states. Second operand has 314 states, 309 states have (on average 1.5566343042071198) internal successors, (481), 309 states have internal predecessors, (481), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:32,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:32,103 INFO L93 Difference]: Finished difference Result 400 states and 606 transitions. [2022-04-27 15:26:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 606 transitions. [2022-04-27 15:26:32,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:32,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:32,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 314 states, 309 states have (on average 1.5566343042071198) internal successors, (481), 309 states have internal predecessors, (481), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 400 states. [2022-04-27 15:26:32,104 INFO L87 Difference]: Start difference. First operand has 314 states, 309 states have (on average 1.5566343042071198) internal successors, (481), 309 states have internal predecessors, (481), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 400 states. [2022-04-27 15:26:32,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:32,113 INFO L93 Difference]: Finished difference Result 400 states and 606 transitions. [2022-04-27 15:26:32,113 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 606 transitions. [2022-04-27 15:26:32,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:32,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:32,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:32,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5566343042071198) internal successors, (481), 309 states have internal predecessors, (481), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 485 transitions. [2022-04-27 15:26:32,118 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 485 transitions. Word has length 121 [2022-04-27 15:26:32,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:32,118 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 485 transitions. [2022-04-27 15:26:32,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 485 transitions. [2022-04-27 15:26:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-27 15:26:32,120 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:32,120 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:32,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:26:32,120 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:32,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1513581320, now seen corresponding path program 1 times [2022-04-27 15:26:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:32,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676770159] [2022-04-27 15:26:32,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:32,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:32,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:32,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {26064#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {26057#true} is VALID [2022-04-27 15:26:32,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {26057#true} assume true; {26057#true} is VALID [2022-04-27 15:26:32,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26057#true} {26057#true} #664#return; {26057#true} is VALID [2022-04-27 15:26:32,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {26057#true} call ULTIMATE.init(); {26064#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:32,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {26064#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {26057#true} is VALID [2022-04-27 15:26:32,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {26057#true} assume true; {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26057#true} {26057#true} #664#return; {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {26057#true} call #t~ret162 := main(); {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {26057#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {26057#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L272 TraceCheckUtils]: 7: Hoare triple {26057#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {26057#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {26057#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {26057#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {26057#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {26057#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {26057#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {26057#true} assume !false; {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {26057#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {26057#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {26057#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-27 15:26:32,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {26057#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-27 15:26:32,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {26057#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-27 15:26:32,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {26057#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-27 15:26:32,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {26057#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-27 15:26:32,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {26057#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-27 15:26:32,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {26057#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-27 15:26:32,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {26057#true} assume 8464 == #t~mem50;havoc #t~mem50; {26057#true} is VALID [2022-04-27 15:26:32,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {26057#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {26057#true} is VALID [2022-04-27 15:26:32,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {26057#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26057#true} is VALID [2022-04-27 15:26:32,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {26057#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:32,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:32,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:32,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:32,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:32,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {26063#(= |ssl3_accept_#t~mem42| 8496)} is VALID [2022-04-27 15:26:32,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {26063#(= |ssl3_accept_#t~mem42| 8496)} assume 12292 == #t~mem42;havoc #t~mem42; {26058#false} is VALID [2022-04-27 15:26:32,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {26058#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {26058#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {26058#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26058#false} is VALID [2022-04-27 15:26:32,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {26058#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {26058#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {26058#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {26058#false} is VALID [2022-04-27 15:26:32,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {26058#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {26058#false} is VALID [2022-04-27 15:26:32,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {26058#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {26058#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {26058#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {26058#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {26058#false} ~skip~0 := 0; {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {26058#false} assume !false; {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {26058#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {26058#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {26058#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 50: Hoare triple {26058#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 51: Hoare triple {26058#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 52: Hoare triple {26058#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {26058#false} assume 8480 == #t~mem47;havoc #t~mem47; {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {26058#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {26058#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem88.base, 844 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {26058#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 57: Hoare triple {26058#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 58: Hoare triple {26058#false} ~skip~0 := 0; {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 59: Hoare triple {26058#false} assume !false; {26058#false} is VALID [2022-04-27 15:26:32,247 INFO L290 TraceCheckUtils]: 60: Hoare triple {26058#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 61: Hoare triple {26058#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {26058#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 63: Hoare triple {26058#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 64: Hoare triple {26058#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {26058#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 66: Hoare triple {26058#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 67: Hoare triple {26058#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 68: Hoare triple {26058#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 69: Hoare triple {26058#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 70: Hoare triple {26058#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 71: Hoare triple {26058#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 72: Hoare triple {26058#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 73: Hoare triple {26058#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 74: Hoare triple {26058#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 75: Hoare triple {26058#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 76: Hoare triple {26058#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,248 INFO L290 TraceCheckUtils]: 77: Hoare triple {26058#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 78: Hoare triple {26058#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 79: Hoare triple {26058#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 80: Hoare triple {26058#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 81: Hoare triple {26058#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 82: Hoare triple {26058#false} assume 8448 == #t~mem63;havoc #t~mem63; {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 83: Hoare triple {26058#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 84: Hoare triple {26058#false} assume !(~num1~0 > 0); {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 85: Hoare triple {26058#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 86: Hoare triple {26058#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 87: Hoare triple {26058#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 88: Hoare triple {26058#false} ~skip~0 := 0; {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 89: Hoare triple {26058#false} assume !false; {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 90: Hoare triple {26058#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 91: Hoare triple {26058#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 92: Hoare triple {26058#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 93: Hoare triple {26058#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,249 INFO L290 TraceCheckUtils]: 94: Hoare triple {26058#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 95: Hoare triple {26058#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 96: Hoare triple {26058#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 97: Hoare triple {26058#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 98: Hoare triple {26058#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 99: Hoare triple {26058#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 100: Hoare triple {26058#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 101: Hoare triple {26058#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 102: Hoare triple {26058#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 103: Hoare triple {26058#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 104: Hoare triple {26058#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 105: Hoare triple {26058#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 106: Hoare triple {26058#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 107: Hoare triple {26058#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 108: Hoare triple {26058#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 109: Hoare triple {26058#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 110: Hoare triple {26058#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,250 INFO L290 TraceCheckUtils]: 111: Hoare triple {26058#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 112: Hoare triple {26058#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 113: Hoare triple {26058#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 114: Hoare triple {26058#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 115: Hoare triple {26058#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 116: Hoare triple {26058#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 117: Hoare triple {26058#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 118: Hoare triple {26058#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 119: Hoare triple {26058#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 120: Hoare triple {26058#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 121: Hoare triple {26058#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 122: Hoare triple {26058#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 123: Hoare triple {26058#false} assume 8672 == #t~mem74;havoc #t~mem74; {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 124: Hoare triple {26058#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 125: Hoare triple {26058#false} assume 4 == ~blastFlag~0; {26058#false} is VALID [2022-04-27 15:26:32,251 INFO L290 TraceCheckUtils]: 126: Hoare triple {26058#false} assume !false; {26058#false} is VALID [2022-04-27 15:26:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-27 15:26:32,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:32,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676770159] [2022-04-27 15:26:32,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676770159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:32,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:32,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:32,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536679047] [2022-04-27 15:26:32,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:32,254 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 127 [2022-04-27 15:26:32,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:32,254 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-27 15:26:32,328 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-27 15:26:32,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:32,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:32,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:32,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:32,330 INFO L87 Difference]: Start difference. First operand 314 states and 485 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-27 15:26:34,349 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-27 15:26:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:35,205 INFO L93 Difference]: Finished difference Result 609 states and 950 transitions. [2022-04-27 15:26:35,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:35,206 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 127 [2022-04-27 15:26:35,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:35,206 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-27 15:26:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2022-04-27 15:26:35,207 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-27 15:26:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2022-04-27 15:26:35,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 438 transitions. [2022-04-27 15:26:35,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 438 edges. 438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:35,410 INFO L225 Difference]: With dead ends: 609 [2022-04-27 15:26:35,411 INFO L226 Difference]: Without dead ends: 321 [2022-04-27 15:26:35,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:35,423 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 30 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:35,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 504 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 364 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:26:35,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-27 15:26:35,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 314. [2022-04-27 15:26:35,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:35,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 314 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 309 states have internal predecessors, (480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:35,428 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 314 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 309 states have internal predecessors, (480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:35,429 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 314 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 309 states have internal predecessors, (480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:35,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:35,432 INFO L93 Difference]: Finished difference Result 321 states and 494 transitions. [2022-04-27 15:26:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 494 transitions. [2022-04-27 15:26:35,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:35,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:35,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 314 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 309 states have internal predecessors, (480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-27 15:26:35,433 INFO L87 Difference]: Start difference. First operand has 314 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 309 states have internal predecessors, (480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-27 15:26:35,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:35,437 INFO L93 Difference]: Finished difference Result 321 states and 494 transitions. [2022-04-27 15:26:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 494 transitions. [2022-04-27 15:26:35,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:35,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:35,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:35,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 309 states have internal predecessors, (480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 484 transitions. [2022-04-27 15:26:35,442 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 484 transitions. Word has length 127 [2022-04-27 15:26:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:35,442 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 484 transitions. [2022-04-27 15:26:35,442 INFO L496 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-27 15:26:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 484 transitions. [2022-04-27 15:26:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-27 15:26:35,443 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:35,443 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:35,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:26:35,443 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:35,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:35,443 INFO L85 PathProgramCache]: Analyzing trace with hash 773095969, now seen corresponding path program 1 times [2022-04-27 15:26:35,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:35,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842311469] [2022-04-27 15:26:35,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:35,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:35,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {27758#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {27752#true} is VALID [2022-04-27 15:26:35,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {27752#true} assume true; {27752#true} is VALID [2022-04-27 15:26:35,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27752#true} {27752#true} #664#return; {27752#true} is VALID [2022-04-27 15:26:35,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {27752#true} call ULTIMATE.init(); {27758#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:35,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {27758#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {27752#true} is VALID [2022-04-27 15:26:35,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {27752#true} assume true; {27752#true} is VALID [2022-04-27 15:26:35,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27752#true} {27752#true} #664#return; {27752#true} is VALID [2022-04-27 15:26:35,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {27752#true} call #t~ret162 := main(); {27752#true} is VALID [2022-04-27 15:26:35,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {27752#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {27752#true} is VALID [2022-04-27 15:26:35,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {27752#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L272 TraceCheckUtils]: 7: Hoare triple {27752#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {27752#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {27752#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {27752#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {27752#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {27752#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {27752#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {27752#true} assume !false; {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {27752#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {27752#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {27752#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {27752#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {27752#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {27752#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {27752#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {27752#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {27752#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {27752#true} assume 8464 == #t~mem50;havoc #t~mem50; {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {27752#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {27752#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {27752#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {27752#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {27752#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {27752#true} ~skip~0 := 0; {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {27752#true} assume !false; {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {27752#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {27752#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {27752#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {27752#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {27752#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {27752#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {27752#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {27752#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {27752#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {27752#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {27752#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {27752#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {27752#true} assume 8496 == #t~mem53;havoc #t~mem53; {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 45: Hoare triple {27752#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 46: Hoare triple {27752#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 47: Hoare triple {27752#true} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 92 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 48: Hoare triple {27752#true} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {27752#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 50: Hoare triple {27752#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 51: Hoare triple {27752#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 52: Hoare triple {27752#true} ~skip~0 := 0; {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {27752#true} assume !false; {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 54: Hoare triple {27752#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 55: Hoare triple {27752#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 56: Hoare triple {27752#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 57: Hoare triple {27752#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,549 INFO L290 TraceCheckUtils]: 58: Hoare triple {27752#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 59: Hoare triple {27752#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 60: Hoare triple {27752#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 61: Hoare triple {27752#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 62: Hoare triple {27752#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 63: Hoare triple {27752#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 64: Hoare triple {27752#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 65: Hoare triple {27752#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 66: Hoare triple {27752#true} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 67: Hoare triple {27752#true} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 68: Hoare triple {27752#true} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 69: Hoare triple {27752#true} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 70: Hoare triple {27752#true} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 71: Hoare triple {27752#true} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 72: Hoare triple {27752#true} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 73: Hoare triple {27752#true} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 74: Hoare triple {27752#true} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,550 INFO L290 TraceCheckUtils]: 75: Hoare triple {27752#true} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,551 INFO L290 TraceCheckUtils]: 76: Hoare triple {27752#true} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,551 INFO L290 TraceCheckUtils]: 77: Hoare triple {27752#true} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,551 INFO L290 TraceCheckUtils]: 78: Hoare triple {27752#true} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,551 INFO L290 TraceCheckUtils]: 79: Hoare triple {27752#true} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,551 INFO L290 TraceCheckUtils]: 80: Hoare triple {27752#true} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,551 INFO L290 TraceCheckUtils]: 81: Hoare triple {27752#true} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,551 INFO L290 TraceCheckUtils]: 82: Hoare triple {27752#true} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,551 INFO L290 TraceCheckUtils]: 83: Hoare triple {27752#true} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,551 INFO L290 TraceCheckUtils]: 84: Hoare triple {27752#true} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-27 15:26:35,551 INFO L290 TraceCheckUtils]: 85: Hoare triple {27752#true} assume 8656 == #t~mem72;havoc #t~mem72; {27752#true} is VALID [2022-04-27 15:26:35,551 INFO L290 TraceCheckUtils]: 86: Hoare triple {27752#true} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 836 + #t~mem140.offset, 4);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 172 + #t~mem139.offset, 4);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {27752#true} is VALID [2022-04-27 15:26:35,551 INFO L290 TraceCheckUtils]: 87: Hoare triple {27752#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {27752#true} is VALID [2022-04-27 15:26:35,552 INFO L290 TraceCheckUtils]: 88: Hoare triple {27752#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 5; {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,552 INFO L290 TraceCheckUtils]: 89: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,552 INFO L290 TraceCheckUtils]: 90: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___10~0); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,552 INFO L290 TraceCheckUtils]: 91: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,553 INFO L290 TraceCheckUtils]: 92: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,553 INFO L290 TraceCheckUtils]: 93: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,553 INFO L290 TraceCheckUtils]: 94: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !false; {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,553 INFO L290 TraceCheckUtils]: 95: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,554 INFO L290 TraceCheckUtils]: 96: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,554 INFO L290 TraceCheckUtils]: 97: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,554 INFO L290 TraceCheckUtils]: 98: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,554 INFO L290 TraceCheckUtils]: 99: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,554 INFO L290 TraceCheckUtils]: 100: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,555 INFO L290 TraceCheckUtils]: 101: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,555 INFO L290 TraceCheckUtils]: 102: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,555 INFO L290 TraceCheckUtils]: 103: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,555 INFO L290 TraceCheckUtils]: 104: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,556 INFO L290 TraceCheckUtils]: 105: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,556 INFO L290 TraceCheckUtils]: 106: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,556 INFO L290 TraceCheckUtils]: 107: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,556 INFO L290 TraceCheckUtils]: 108: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,557 INFO L290 TraceCheckUtils]: 109: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,557 INFO L290 TraceCheckUtils]: 110: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,557 INFO L290 TraceCheckUtils]: 111: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,557 INFO L290 TraceCheckUtils]: 112: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,558 INFO L290 TraceCheckUtils]: 113: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,558 INFO L290 TraceCheckUtils]: 114: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,558 INFO L290 TraceCheckUtils]: 115: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,558 INFO L290 TraceCheckUtils]: 116: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,560 INFO L290 TraceCheckUtils]: 117: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,560 INFO L290 TraceCheckUtils]: 118: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,561 INFO L290 TraceCheckUtils]: 119: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,561 INFO L290 TraceCheckUtils]: 120: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,561 INFO L290 TraceCheckUtils]: 121: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,561 INFO L290 TraceCheckUtils]: 122: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,562 INFO L290 TraceCheckUtils]: 123: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,562 INFO L290 TraceCheckUtils]: 124: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,562 INFO L290 TraceCheckUtils]: 125: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,562 INFO L290 TraceCheckUtils]: 126: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,563 INFO L290 TraceCheckUtils]: 127: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,563 INFO L290 TraceCheckUtils]: 128: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume 8672 == #t~mem74;havoc #t~mem74; {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,563 INFO L290 TraceCheckUtils]: 129: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:35,563 INFO L290 TraceCheckUtils]: 130: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume 4 == ~blastFlag~0; {27753#false} is VALID [2022-04-27 15:26:35,563 INFO L290 TraceCheckUtils]: 131: Hoare triple {27753#false} assume !false; {27753#false} is VALID [2022-04-27 15:26:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 15:26:35,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:35,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842311469] [2022-04-27 15:26:35,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842311469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:35,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:35,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:26:35,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187360732] [2022-04-27 15:26:35,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:35,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-27 15:26:35,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:35,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:35,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:35,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:26:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:35,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:26:35,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:26:35,637 INFO L87 Difference]: Start difference. First operand 314 states and 484 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:37,651 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-27 15:26:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:38,617 INFO L93 Difference]: Finished difference Result 890 states and 1392 transitions. [2022-04-27 15:26:38,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:26:38,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-27 15:26:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2022-04-27 15:26:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2022-04-27 15:26:38,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 586 transitions. [2022-04-27 15:26:39,014 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-27 15:26:39,026 INFO L225 Difference]: With dead ends: 890 [2022-04-27 15:26:39,026 INFO L226 Difference]: Without dead ends: 602 [2022-04-27 15:26:39,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:26:39,027 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 143 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:39,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 565 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 395 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:26:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-04-27 15:26:39,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2022-04-27 15:26:39,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:39,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 602 states. Second operand has 600 states, 595 states have (on average 1.5596638655462185) internal successors, (928), 595 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:39,083 INFO L74 IsIncluded]: Start isIncluded. First operand 602 states. Second operand has 600 states, 595 states have (on average 1.5596638655462185) internal successors, (928), 595 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:39,084 INFO L87 Difference]: Start difference. First operand 602 states. Second operand has 600 states, 595 states have (on average 1.5596638655462185) internal successors, (928), 595 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:39,094 INFO L93 Difference]: Finished difference Result 602 states and 933 transitions. [2022-04-27 15:26:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 933 transitions. [2022-04-27 15:26:39,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:39,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:39,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 600 states, 595 states have (on average 1.5596638655462185) internal successors, (928), 595 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 602 states. [2022-04-27 15:26:39,096 INFO L87 Difference]: Start difference. First operand has 600 states, 595 states have (on average 1.5596638655462185) internal successors, (928), 595 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 602 states. [2022-04-27 15:26:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:39,107 INFO L93 Difference]: Finished difference Result 602 states and 933 transitions. [2022-04-27 15:26:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 933 transitions. [2022-04-27 15:26:39,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:39,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:39,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:39,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 595 states have (on average 1.5596638655462185) internal successors, (928), 595 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 932 transitions. [2022-04-27 15:26:39,121 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 932 transitions. Word has length 132 [2022-04-27 15:26:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:39,121 INFO L495 AbstractCegarLoop]: Abstraction has 600 states and 932 transitions. [2022-04-27 15:26:39,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 932 transitions. [2022-04-27 15:26:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-27 15:26:39,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:39,122 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:39,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:26:39,122 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1276291873, now seen corresponding path program 1 times [2022-04-27 15:26:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:39,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382733673] [2022-04-27 15:26:39,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:39,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:39,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:39,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {30644#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {30638#true} is VALID [2022-04-27 15:26:39,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {30638#true} assume true; {30638#true} is VALID [2022-04-27 15:26:39,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30638#true} {30638#true} #664#return; {30638#true} is VALID [2022-04-27 15:26:39,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {30638#true} call ULTIMATE.init(); {30644#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:39,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {30644#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {30638#true} is VALID [2022-04-27 15:26:39,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {30638#true} assume true; {30638#true} is VALID [2022-04-27 15:26:39,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30638#true} {30638#true} #664#return; {30638#true} is VALID [2022-04-27 15:26:39,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {30638#true} call #t~ret162 := main(); {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {30638#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {30638#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L272 TraceCheckUtils]: 7: Hoare triple {30638#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {30638#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {30638#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {30638#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {30638#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {30638#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {30638#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {30638#true} assume !false; {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {30638#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {30638#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {30638#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {30638#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {30638#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {30638#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {30638#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {30638#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {30638#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {30638#true} assume 8464 == #t~mem50;havoc #t~mem50; {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {30638#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {30638#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {30638#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {30638#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {30638#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {30638#true} ~skip~0 := 0; {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {30638#true} assume !false; {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {30638#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {30638#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {30638#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {30638#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {30638#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {30638#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {30638#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {30638#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {30638#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {30638#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {30638#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {30638#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-27 15:26:39,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {30638#true} assume 8496 == #t~mem53;havoc #t~mem53; {30638#true} is VALID [2022-04-27 15:26:39,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {30638#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {30638#true} is VALID [2022-04-27 15:26:39,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {30638#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 92 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,244 INFO L290 TraceCheckUtils]: 48: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,244 INFO L290 TraceCheckUtils]: 49: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,244 INFO L290 TraceCheckUtils]: 50: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,244 INFO L290 TraceCheckUtils]: 51: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,245 INFO L290 TraceCheckUtils]: 52: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,245 INFO L290 TraceCheckUtils]: 53: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,245 INFO L290 TraceCheckUtils]: 54: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,245 INFO L290 TraceCheckUtils]: 55: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,246 INFO L290 TraceCheckUtils]: 56: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,246 INFO L290 TraceCheckUtils]: 57: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,246 INFO L290 TraceCheckUtils]: 58: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,246 INFO L290 TraceCheckUtils]: 59: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,246 INFO L290 TraceCheckUtils]: 60: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,247 INFO L290 TraceCheckUtils]: 61: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,247 INFO L290 TraceCheckUtils]: 62: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,247 INFO L290 TraceCheckUtils]: 63: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,247 INFO L290 TraceCheckUtils]: 64: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,248 INFO L290 TraceCheckUtils]: 66: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,248 INFO L290 TraceCheckUtils]: 67: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,248 INFO L290 TraceCheckUtils]: 68: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,249 INFO L290 TraceCheckUtils]: 69: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,249 INFO L290 TraceCheckUtils]: 70: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,249 INFO L290 TraceCheckUtils]: 71: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,249 INFO L290 TraceCheckUtils]: 72: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,250 INFO L290 TraceCheckUtils]: 73: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,250 INFO L290 TraceCheckUtils]: 74: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,250 INFO L290 TraceCheckUtils]: 75: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,250 INFO L290 TraceCheckUtils]: 76: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,251 INFO L290 TraceCheckUtils]: 77: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,251 INFO L290 TraceCheckUtils]: 78: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,251 INFO L290 TraceCheckUtils]: 79: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,251 INFO L290 TraceCheckUtils]: 80: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,252 INFO L290 TraceCheckUtils]: 81: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,252 INFO L290 TraceCheckUtils]: 82: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,252 INFO L290 TraceCheckUtils]: 83: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,252 INFO L290 TraceCheckUtils]: 84: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,253 INFO L290 TraceCheckUtils]: 85: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume 8656 == #t~mem72;havoc #t~mem72; {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,253 INFO L290 TraceCheckUtils]: 86: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 836 + #t~mem140.offset, 4);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 172 + #t~mem139.offset, 4);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,253 INFO L290 TraceCheckUtils]: 87: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:26:39,253 INFO L290 TraceCheckUtils]: 88: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(2 == ~blastFlag~0); {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 89: Hoare triple {30639#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 90: Hoare triple {30639#false} assume !(0 == ~tmp___10~0); {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 91: Hoare triple {30639#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 92: Hoare triple {30639#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 93: Hoare triple {30639#false} ~skip~0 := 0; {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 94: Hoare triple {30639#false} assume !false; {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 95: Hoare triple {30639#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 96: Hoare triple {30639#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 97: Hoare triple {30639#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 98: Hoare triple {30639#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 99: Hoare triple {30639#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 100: Hoare triple {30639#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 101: Hoare triple {30639#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 102: Hoare triple {30639#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 103: Hoare triple {30639#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 104: Hoare triple {30639#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,254 INFO L290 TraceCheckUtils]: 105: Hoare triple {30639#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 106: Hoare triple {30639#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 107: Hoare triple {30639#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 108: Hoare triple {30639#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 109: Hoare triple {30639#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 110: Hoare triple {30639#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 111: Hoare triple {30639#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 112: Hoare triple {30639#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 113: Hoare triple {30639#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 114: Hoare triple {30639#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 115: Hoare triple {30639#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 116: Hoare triple {30639#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 117: Hoare triple {30639#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 118: Hoare triple {30639#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 119: Hoare triple {30639#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 120: Hoare triple {30639#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 121: Hoare triple {30639#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,255 INFO L290 TraceCheckUtils]: 122: Hoare triple {30639#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,256 INFO L290 TraceCheckUtils]: 123: Hoare triple {30639#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,256 INFO L290 TraceCheckUtils]: 124: Hoare triple {30639#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,256 INFO L290 TraceCheckUtils]: 125: Hoare triple {30639#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,256 INFO L290 TraceCheckUtils]: 126: Hoare triple {30639#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,256 INFO L290 TraceCheckUtils]: 127: Hoare triple {30639#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-27 15:26:39,256 INFO L290 TraceCheckUtils]: 128: Hoare triple {30639#false} assume 8672 == #t~mem74;havoc #t~mem74; {30639#false} is VALID [2022-04-27 15:26:39,256 INFO L290 TraceCheckUtils]: 129: Hoare triple {30639#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {30639#false} is VALID [2022-04-27 15:26:39,256 INFO L290 TraceCheckUtils]: 130: Hoare triple {30639#false} assume 4 == ~blastFlag~0; {30639#false} is VALID [2022-04-27 15:26:39,256 INFO L290 TraceCheckUtils]: 131: Hoare triple {30639#false} assume !false; {30639#false} is VALID [2022-04-27 15:26:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:26:39,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:39,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382733673] [2022-04-27 15:26:39,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382733673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:39,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:39,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:26:39,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059186887] [2022-04-27 15:26:39,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:39,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-27 15:26:39,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:39,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:39,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:39,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:26:39,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:39,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:26:39,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:26:39,342 INFO L87 Difference]: Start difference. First operand 600 states and 932 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:41,360 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-27 15:26:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:42,149 INFO L93 Difference]: Finished difference Result 1415 states and 2211 transitions. [2022-04-27 15:26:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:26:42,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-27 15:26:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-04-27 15:26:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-04-27 15:26:42,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 583 transitions. [2022-04-27 15:26:42,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:42,579 INFO L225 Difference]: With dead ends: 1415 [2022-04-27 15:26:42,579 INFO L226 Difference]: Without dead ends: 841 [2022-04-27 15:26:42,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:26:42,608 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 138 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:42,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 438 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:26:42,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-04-27 15:26:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2022-04-27 15:26:42,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:42,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 841 states. Second operand has 841 states, 836 states have (on average 1.5538277511961722) internal successors, (1299), 836 states have internal predecessors, (1299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:42,644 INFO L74 IsIncluded]: Start isIncluded. First operand 841 states. Second operand has 841 states, 836 states have (on average 1.5538277511961722) internal successors, (1299), 836 states have internal predecessors, (1299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:42,644 INFO L87 Difference]: Start difference. First operand 841 states. Second operand has 841 states, 836 states have (on average 1.5538277511961722) internal successors, (1299), 836 states have internal predecessors, (1299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:42,680 INFO L93 Difference]: Finished difference Result 841 states and 1303 transitions. [2022-04-27 15:26:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1303 transitions. [2022-04-27 15:26:42,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:42,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:42,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 836 states have (on average 1.5538277511961722) internal successors, (1299), 836 states have internal predecessors, (1299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 841 states. [2022-04-27 15:26:42,694 INFO L87 Difference]: Start difference. First operand has 841 states, 836 states have (on average 1.5538277511961722) internal successors, (1299), 836 states have internal predecessors, (1299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 841 states. [2022-04-27 15:26:42,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:42,729 INFO L93 Difference]: Finished difference Result 841 states and 1303 transitions. [2022-04-27 15:26:42,729 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1303 transitions. [2022-04-27 15:26:42,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:42,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:42,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:42,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 836 states have (on average 1.5538277511961722) internal successors, (1299), 836 states have internal predecessors, (1299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1303 transitions. [2022-04-27 15:26:42,767 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1303 transitions. Word has length 132 [2022-04-27 15:26:42,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:42,767 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1303 transitions. [2022-04-27 15:26:42,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1303 transitions. [2022-04-27 15:26:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-27 15:26:42,769 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:42,769 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:42,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:26:42,769 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:42,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1060100637, now seen corresponding path program 1 times [2022-04-27 15:26:42,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:42,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005159365] [2022-04-27 15:26:42,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:42,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:42,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:42,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {34868#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {34862#true} is VALID [2022-04-27 15:26:42,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {34862#true} assume true; {34862#true} is VALID [2022-04-27 15:26:42,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34862#true} {34862#true} #664#return; {34862#true} is VALID [2022-04-27 15:26:42,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {34862#true} call ULTIMATE.init(); {34868#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:42,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {34868#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {34862#true} is VALID [2022-04-27 15:26:42,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {34862#true} assume true; {34862#true} is VALID [2022-04-27 15:26:42,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34862#true} {34862#true} #664#return; {34862#true} is VALID [2022-04-27 15:26:42,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {34862#true} call #t~ret162 := main(); {34862#true} is VALID [2022-04-27 15:26:42,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {34862#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {34862#true} is VALID [2022-04-27 15:26:42,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {34862#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {34862#true} is VALID [2022-04-27 15:26:42,935 INFO L272 TraceCheckUtils]: 7: Hoare triple {34862#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {34862#true} is VALID [2022-04-27 15:26:42,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {34862#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {34862#true} is VALID [2022-04-27 15:26:42,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {34862#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {34862#true} is VALID [2022-04-27 15:26:42,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {34862#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {34862#true} is VALID [2022-04-27 15:26:42,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {34862#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {34862#true} is VALID [2022-04-27 15:26:42,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {34862#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {34862#true} is VALID [2022-04-27 15:26:42,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {34862#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {34862#true} is VALID [2022-04-27 15:26:42,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {34862#true} assume !false; {34862#true} is VALID [2022-04-27 15:26:42,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {34862#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-27 15:26:42,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {34862#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-27 15:26:42,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {34862#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-27 15:26:42,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {34862#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-27 15:26:42,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {34862#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-27 15:26:42,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {34862#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-27 15:26:42,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {34862#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-27 15:26:42,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {34862#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-27 15:26:42,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {34862#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-27 15:26:42,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {34862#true} assume 8464 == #t~mem50;havoc #t~mem50; {34862#true} is VALID [2022-04-27 15:26:42,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {34862#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {34862#true} is VALID [2022-04-27 15:26:42,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {34862#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !false; {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,945 INFO L290 TraceCheckUtils]: 41: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,946 INFO L290 TraceCheckUtils]: 43: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,946 INFO L290 TraceCheckUtils]: 44: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem53;havoc #t~mem53; {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:26:42,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 47: Hoare triple {34863#false} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 92 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 48: Hoare triple {34863#false} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {34863#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {34863#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 51: Hoare triple {34863#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 52: Hoare triple {34863#false} ~skip~0 := 0; {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 53: Hoare triple {34863#false} assume !false; {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {34863#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 55: Hoare triple {34863#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {34863#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 57: Hoare triple {34863#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 58: Hoare triple {34863#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 59: Hoare triple {34863#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 60: Hoare triple {34863#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 61: Hoare triple {34863#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 62: Hoare triple {34863#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,947 INFO L290 TraceCheckUtils]: 63: Hoare triple {34863#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 64: Hoare triple {34863#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 65: Hoare triple {34863#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 66: Hoare triple {34863#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 67: Hoare triple {34863#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 68: Hoare triple {34863#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 69: Hoare triple {34863#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 70: Hoare triple {34863#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 71: Hoare triple {34863#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 72: Hoare triple {34863#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 73: Hoare triple {34863#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 74: Hoare triple {34863#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 75: Hoare triple {34863#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 76: Hoare triple {34863#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 77: Hoare triple {34863#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 78: Hoare triple {34863#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 79: Hoare triple {34863#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,948 INFO L290 TraceCheckUtils]: 80: Hoare triple {34863#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 81: Hoare triple {34863#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 82: Hoare triple {34863#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 83: Hoare triple {34863#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 84: Hoare triple {34863#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 85: Hoare triple {34863#false} assume 8656 == #t~mem72;havoc #t~mem72; {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 86: Hoare triple {34863#false} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 836 + #t~mem140.offset, 4);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 172 + #t~mem139.offset, 4);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 87: Hoare triple {34863#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 88: Hoare triple {34863#false} assume !(2 == ~blastFlag~0); {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 89: Hoare triple {34863#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 90: Hoare triple {34863#false} assume !(0 == ~tmp___10~0); {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 91: Hoare triple {34863#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 92: Hoare triple {34863#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 93: Hoare triple {34863#false} ~skip~0 := 0; {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 94: Hoare triple {34863#false} assume !false; {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 95: Hoare triple {34863#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 96: Hoare triple {34863#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 97: Hoare triple {34863#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,949 INFO L290 TraceCheckUtils]: 98: Hoare triple {34863#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 99: Hoare triple {34863#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 100: Hoare triple {34863#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 101: Hoare triple {34863#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 102: Hoare triple {34863#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 103: Hoare triple {34863#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 104: Hoare triple {34863#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 105: Hoare triple {34863#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 106: Hoare triple {34863#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 107: Hoare triple {34863#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 108: Hoare triple {34863#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 109: Hoare triple {34863#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 110: Hoare triple {34863#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 111: Hoare triple {34863#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 112: Hoare triple {34863#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 113: Hoare triple {34863#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 114: Hoare triple {34863#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,950 INFO L290 TraceCheckUtils]: 115: Hoare triple {34863#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 116: Hoare triple {34863#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 117: Hoare triple {34863#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 118: Hoare triple {34863#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 119: Hoare triple {34863#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 120: Hoare triple {34863#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 121: Hoare triple {34863#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 122: Hoare triple {34863#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 123: Hoare triple {34863#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 124: Hoare triple {34863#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 125: Hoare triple {34863#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 126: Hoare triple {34863#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 127: Hoare triple {34863#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 128: Hoare triple {34863#false} assume 8672 == #t~mem74;havoc #t~mem74; {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 129: Hoare triple {34863#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 130: Hoare triple {34863#false} assume 4 == ~blastFlag~0; {34863#false} is VALID [2022-04-27 15:26:42,951 INFO L290 TraceCheckUtils]: 131: Hoare triple {34863#false} assume !false; {34863#false} is VALID [2022-04-27 15:26:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 15:26:42,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:42,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005159365] [2022-04-27 15:26:42,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005159365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:42,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:42,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:26:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041914748] [2022-04-27 15:26:42,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:42,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-27 15:26:42,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:42,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:43,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:43,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:26:43,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:43,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:26:43,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:26:43,051 INFO L87 Difference]: Start difference. First operand 841 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:45,080 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-27 15:26:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:45,770 INFO L93 Difference]: Finished difference Result 1683 states and 2613 transitions. [2022-04-27 15:26:45,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:26:45,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-27 15:26:45,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-04-27 15:26:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-04-27 15:26:45,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 434 transitions. [2022-04-27 15:26:46,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:46,109 INFO L225 Difference]: With dead ends: 1683 [2022-04-27 15:26:46,109 INFO L226 Difference]: Without dead ends: 868 [2022-04-27 15:26:46,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:26:46,114 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 15 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:46,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 411 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:26:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-04-27 15:26:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2022-04-27 15:26:46,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:46,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 868 states. Second operand has 868 states, 863 states have (on average 1.5457705677867903) internal successors, (1334), 863 states have internal predecessors, (1334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:46,140 INFO L74 IsIncluded]: Start isIncluded. First operand 868 states. Second operand has 868 states, 863 states have (on average 1.5457705677867903) internal successors, (1334), 863 states have internal predecessors, (1334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:46,140 INFO L87 Difference]: Start difference. First operand 868 states. Second operand has 868 states, 863 states have (on average 1.5457705677867903) internal successors, (1334), 863 states have internal predecessors, (1334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:46,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:46,161 INFO L93 Difference]: Finished difference Result 868 states and 1338 transitions. [2022-04-27 15:26:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1338 transitions. [2022-04-27 15:26:46,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:46,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:46,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 868 states, 863 states have (on average 1.5457705677867903) internal successors, (1334), 863 states have internal predecessors, (1334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 868 states. [2022-04-27 15:26:46,164 INFO L87 Difference]: Start difference. First operand has 868 states, 863 states have (on average 1.5457705677867903) internal successors, (1334), 863 states have internal predecessors, (1334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 868 states. [2022-04-27 15:26:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:46,186 INFO L93 Difference]: Finished difference Result 868 states and 1338 transitions. [2022-04-27 15:26:46,186 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1338 transitions. [2022-04-27 15:26:46,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:46,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:46,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:46,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 863 states have (on average 1.5457705677867903) internal successors, (1334), 863 states have internal predecessors, (1334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1338 transitions. [2022-04-27 15:26:46,211 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1338 transitions. Word has length 132 [2022-04-27 15:26:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:46,211 INFO L495 AbstractCegarLoop]: Abstraction has 868 states and 1338 transitions. [2022-04-27 15:26:46,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1338 transitions. [2022-04-27 15:26:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-27 15:26:46,212 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:46,212 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:46,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 15:26:46,212 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:46,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:46,213 INFO L85 PathProgramCache]: Analyzing trace with hash 436819035, now seen corresponding path program 1 times [2022-04-27 15:26:46,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:46,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323358588] [2022-04-27 15:26:46,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:46,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:46,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {39480#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {39474#true} is VALID [2022-04-27 15:26:46,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {39474#true} assume true; {39474#true} is VALID [2022-04-27 15:26:46,297 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39474#true} {39474#true} #664#return; {39474#true} is VALID [2022-04-27 15:26:46,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {39474#true} call ULTIMATE.init(); {39480#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:46,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {39480#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {39474#true} is VALID [2022-04-27 15:26:46,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {39474#true} assume true; {39474#true} is VALID [2022-04-27 15:26:46,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39474#true} {39474#true} #664#return; {39474#true} is VALID [2022-04-27 15:26:46,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {39474#true} call #t~ret162 := main(); {39474#true} is VALID [2022-04-27 15:26:46,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {39474#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {39474#true} is VALID [2022-04-27 15:26:46,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {39474#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {39474#true} is VALID [2022-04-27 15:26:46,298 INFO L272 TraceCheckUtils]: 7: Hoare triple {39474#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {39474#true} is VALID [2022-04-27 15:26:46,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {39474#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !false; {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem50;havoc #t~mem50; {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:26:46,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {39475#false} is VALID [2022-04-27 15:26:46,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {39475#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {39475#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {39475#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {39475#false} is VALID [2022-04-27 15:26:46,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {39475#false} ~skip~0 := 0; {39475#false} is VALID [2022-04-27 15:26:46,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {39475#false} assume !false; {39475#false} is VALID [2022-04-27 15:26:46,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {39475#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {39475#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {39475#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {39475#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {39475#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {39475#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {39475#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {39475#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {39475#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {39475#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {39475#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {39475#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {39475#false} assume 8496 == #t~mem53;havoc #t~mem53; {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {39475#false} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {39475#false} assume !(1 == ~blastFlag~0); {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {39475#false} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 92 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {39475#false} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {39475#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {39475#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 51: Hoare triple {39475#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {39475#false} is VALID [2022-04-27 15:26:46,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {39475#false} ~skip~0 := 0; {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {39475#false} assume !false; {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {39475#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 55: Hoare triple {39475#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {39475#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {39475#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {39475#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {39475#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 60: Hoare triple {39475#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 61: Hoare triple {39475#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 62: Hoare triple {39475#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 63: Hoare triple {39475#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 64: Hoare triple {39475#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 65: Hoare triple {39475#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 66: Hoare triple {39475#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 67: Hoare triple {39475#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 68: Hoare triple {39475#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 69: Hoare triple {39475#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,305 INFO L290 TraceCheckUtils]: 70: Hoare triple {39475#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 71: Hoare triple {39475#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 72: Hoare triple {39475#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 73: Hoare triple {39475#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 74: Hoare triple {39475#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 75: Hoare triple {39475#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 76: Hoare triple {39475#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 77: Hoare triple {39475#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 78: Hoare triple {39475#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 79: Hoare triple {39475#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 80: Hoare triple {39475#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 81: Hoare triple {39475#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 82: Hoare triple {39475#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 83: Hoare triple {39475#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 84: Hoare triple {39475#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 85: Hoare triple {39475#false} assume 8656 == #t~mem72;havoc #t~mem72; {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 86: Hoare triple {39475#false} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 836 + #t~mem140.offset, 4);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 172 + #t~mem139.offset, 4);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {39475#false} is VALID [2022-04-27 15:26:46,306 INFO L290 TraceCheckUtils]: 87: Hoare triple {39475#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 88: Hoare triple {39475#false} assume !(2 == ~blastFlag~0); {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 89: Hoare triple {39475#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 90: Hoare triple {39475#false} assume !(0 == ~tmp___10~0); {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 91: Hoare triple {39475#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 92: Hoare triple {39475#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 93: Hoare triple {39475#false} ~skip~0 := 0; {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 94: Hoare triple {39475#false} assume !false; {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 95: Hoare triple {39475#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 96: Hoare triple {39475#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 97: Hoare triple {39475#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 98: Hoare triple {39475#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 99: Hoare triple {39475#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 100: Hoare triple {39475#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 101: Hoare triple {39475#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 102: Hoare triple {39475#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 103: Hoare triple {39475#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,307 INFO L290 TraceCheckUtils]: 104: Hoare triple {39475#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 105: Hoare triple {39475#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 106: Hoare triple {39475#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 107: Hoare triple {39475#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 108: Hoare triple {39475#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 109: Hoare triple {39475#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 110: Hoare triple {39475#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 111: Hoare triple {39475#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 112: Hoare triple {39475#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 113: Hoare triple {39475#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 114: Hoare triple {39475#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 115: Hoare triple {39475#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 116: Hoare triple {39475#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 117: Hoare triple {39475#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 118: Hoare triple {39475#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 119: Hoare triple {39475#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 120: Hoare triple {39475#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,308 INFO L290 TraceCheckUtils]: 121: Hoare triple {39475#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,309 INFO L290 TraceCheckUtils]: 122: Hoare triple {39475#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,309 INFO L290 TraceCheckUtils]: 123: Hoare triple {39475#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,309 INFO L290 TraceCheckUtils]: 124: Hoare triple {39475#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,309 INFO L290 TraceCheckUtils]: 125: Hoare triple {39475#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,309 INFO L290 TraceCheckUtils]: 126: Hoare triple {39475#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,309 INFO L290 TraceCheckUtils]: 127: Hoare triple {39475#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-27 15:26:46,309 INFO L290 TraceCheckUtils]: 128: Hoare triple {39475#false} assume 8672 == #t~mem74;havoc #t~mem74; {39475#false} is VALID [2022-04-27 15:26:46,309 INFO L290 TraceCheckUtils]: 129: Hoare triple {39475#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {39475#false} is VALID [2022-04-27 15:26:46,309 INFO L290 TraceCheckUtils]: 130: Hoare triple {39475#false} assume 4 == ~blastFlag~0; {39475#false} is VALID [2022-04-27 15:26:46,309 INFO L290 TraceCheckUtils]: 131: Hoare triple {39475#false} assume !false; {39475#false} is VALID [2022-04-27 15:26:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-27 15:26:46,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:46,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323358588] [2022-04-27 15:26:46,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323358588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:46,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:46,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:26:46,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490961973] [2022-04-27 15:26:46,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:46,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-27 15:26:46,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:46,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:46,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:46,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:26:46,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:46,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:26:46,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:26:46,369 INFO L87 Difference]: Start difference. First operand 868 states and 1338 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:48,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:26:49,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:49,027 INFO L93 Difference]: Finished difference Result 1426 states and 2196 transitions. [2022-04-27 15:26:49,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:26:49,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-27 15:26:49,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2022-04-27 15:26:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2022-04-27 15:26:49,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 408 transitions. [2022-04-27 15:26:49,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:49,302 INFO L225 Difference]: With dead ends: 1426 [2022-04-27 15:26:49,302 INFO L226 Difference]: Without dead ends: 584 [2022-04-27 15:26:49,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:26:49,311 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 4 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:49,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 388 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:26:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-04-27 15:26:49,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2022-04-27 15:26:49,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:49,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5250431778929188) internal successors, (883), 579 states have internal predecessors, (883), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:49,357 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5250431778929188) internal successors, (883), 579 states have internal predecessors, (883), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:49,358 INFO L87 Difference]: Start difference. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5250431778929188) internal successors, (883), 579 states have internal predecessors, (883), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:49,368 INFO L93 Difference]: Finished difference Result 584 states and 887 transitions. [2022-04-27 15:26:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 887 transitions. [2022-04-27 15:26:49,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:49,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:49,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 584 states, 579 states have (on average 1.5250431778929188) internal successors, (883), 579 states have internal predecessors, (883), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 584 states. [2022-04-27 15:26:49,369 INFO L87 Difference]: Start difference. First operand has 584 states, 579 states have (on average 1.5250431778929188) internal successors, (883), 579 states have internal predecessors, (883), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 584 states. [2022-04-27 15:26:49,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:49,385 INFO L93 Difference]: Finished difference Result 584 states and 887 transitions. [2022-04-27 15:26:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 887 transitions. [2022-04-27 15:26:49,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:49,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:49,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:49,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.5250431778929188) internal successors, (883), 579 states have internal predecessors, (883), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 887 transitions. [2022-04-27 15:26:49,412 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 887 transitions. Word has length 132 [2022-04-27 15:26:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:49,412 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 887 transitions. [2022-04-27 15:26:49,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 887 transitions. [2022-04-27 15:26:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-27 15:26:49,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:49,413 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:49,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 15:26:49,413 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1803828749, now seen corresponding path program 1 times [2022-04-27 15:26:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:49,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988649070] [2022-04-27 15:26:49,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:49,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:49,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {42926#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {42917#true} is VALID [2022-04-27 15:26:49,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {42917#true} assume true; {42917#true} is VALID [2022-04-27 15:26:49,853 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42917#true} {42917#true} #664#return; {42917#true} is VALID [2022-04-27 15:26:49,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {42917#true} call ULTIMATE.init(); {42926#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:49,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {42926#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.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); {42917#true} is VALID [2022-04-27 15:26:49,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {42917#true} assume true; {42917#true} is VALID [2022-04-27 15:26:49,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42917#true} {42917#true} #664#return; {42917#true} is VALID [2022-04-27 15:26:49,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {42917#true} call #t~ret162 := main(); {42917#true} is VALID [2022-04-27 15:26:49,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {42917#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {42917#true} is VALID [2022-04-27 15:26:49,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {42917#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {42922#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} is VALID [2022-04-27 15:26:49,855 INFO L272 TraceCheckUtils]: 7: Hoare triple {42922#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {42923#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} is VALID [2022-04-27 15:26:49,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {42923#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:26:49,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:26:49,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:26:49,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:26:49,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {42925#(and (= |ssl3_accept_#t~mem40.base| 0) (= |ssl3_accept_#t~mem40.offset| 0))} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {42925#(and (= |ssl3_accept_#t~mem40.base| 0) (= |ssl3_accept_#t~mem40.offset| 0))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {42918#false} assume !false; {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {42918#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {42918#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {42918#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {42918#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {42918#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {42918#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {42918#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {42918#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {42918#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {42918#false} assume 8464 == #t~mem50;havoc #t~mem50; {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {42918#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {42918#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {42918#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {42918#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {42918#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {42918#false} ~skip~0 := 0; {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {42918#false} assume !false; {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {42918#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {42918#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {42918#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {42918#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {42918#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {42918#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {42918#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {42918#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {42918#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {42918#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 42: Hoare triple {42918#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 43: Hoare triple {42918#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 44: Hoare triple {42918#false} assume 8496 == #t~mem53;havoc #t~mem53; {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {42918#false} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {42918#false} is VALID [2022-04-27 15:26:49,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {42918#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 47: Hoare triple {42918#false} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 92 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 48: Hoare triple {42918#false} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {42918#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {42918#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {42918#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {42918#false} ~skip~0 := 0; {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {42918#false} assume !false; {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {42918#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 55: Hoare triple {42918#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 56: Hoare triple {42918#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 57: Hoare triple {42918#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 58: Hoare triple {42918#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 59: Hoare triple {42918#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 60: Hoare triple {42918#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 61: Hoare triple {42918#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 62: Hoare triple {42918#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,861 INFO L290 TraceCheckUtils]: 63: Hoare triple {42918#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 64: Hoare triple {42918#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {42918#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 66: Hoare triple {42918#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 67: Hoare triple {42918#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 68: Hoare triple {42918#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 69: Hoare triple {42918#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 70: Hoare triple {42918#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 71: Hoare triple {42918#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 72: Hoare triple {42918#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 73: Hoare triple {42918#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 74: Hoare triple {42918#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 75: Hoare triple {42918#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 76: Hoare triple {42918#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 77: Hoare triple {42918#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 78: Hoare triple {42918#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 79: Hoare triple {42918#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,862 INFO L290 TraceCheckUtils]: 80: Hoare triple {42918#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 81: Hoare triple {42918#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 82: Hoare triple {42918#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 83: Hoare triple {42918#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 84: Hoare triple {42918#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 85: Hoare triple {42918#false} assume 8656 == #t~mem72;havoc #t~mem72; {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 86: Hoare triple {42918#false} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 836 + #t~mem140.offset, 4);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 172 + #t~mem139.offset, 4);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 87: Hoare triple {42918#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 88: Hoare triple {42918#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 5; {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 89: Hoare triple {42918#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 90: Hoare triple {42918#false} assume !(0 == ~tmp___10~0); {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 91: Hoare triple {42918#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 92: Hoare triple {42918#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 93: Hoare triple {42918#false} ~skip~0 := 0; {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 94: Hoare triple {42918#false} assume !false; {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 95: Hoare triple {42918#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 96: Hoare triple {42918#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,863 INFO L290 TraceCheckUtils]: 97: Hoare triple {42918#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 98: Hoare triple {42918#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 99: Hoare triple {42918#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 100: Hoare triple {42918#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 101: Hoare triple {42918#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 102: Hoare triple {42918#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 103: Hoare triple {42918#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 104: Hoare triple {42918#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 105: Hoare triple {42918#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 106: Hoare triple {42918#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 107: Hoare triple {42918#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 108: Hoare triple {42918#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 109: Hoare triple {42918#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 110: Hoare triple {42918#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 111: Hoare triple {42918#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 112: Hoare triple {42918#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 113: Hoare triple {42918#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,864 INFO L290 TraceCheckUtils]: 114: Hoare triple {42918#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 115: Hoare triple {42918#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 116: Hoare triple {42918#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 117: Hoare triple {42918#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 118: Hoare triple {42918#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 119: Hoare triple {42918#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 120: Hoare triple {42918#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 121: Hoare triple {42918#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 122: Hoare triple {42918#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 123: Hoare triple {42918#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 124: Hoare triple {42918#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 125: Hoare triple {42918#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 126: Hoare triple {42918#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 127: Hoare triple {42918#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 128: Hoare triple {42918#false} assume 8672 == #t~mem74;havoc #t~mem74; {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 129: Hoare triple {42918#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 130: Hoare triple {42918#false} assume !(4 == ~blastFlag~0); {42918#false} is VALID [2022-04-27 15:26:49,865 INFO L290 TraceCheckUtils]: 131: Hoare triple {42918#false} assume 5 == ~blastFlag~0; {42918#false} is VALID [2022-04-27 15:26:49,866 INFO L290 TraceCheckUtils]: 132: Hoare triple {42918#false} assume !false; {42918#false} is VALID [2022-04-27 15:26:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-27 15:26:49,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:49,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988649070] [2022-04-27 15:26:49,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988649070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:49,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:49,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 15:26:49,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901004803] [2022-04-27 15:26:49,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:49,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-27 15:26:49,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:49,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:49,929 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-27 15:26:49,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 15:26:49,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:49,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 15:26:49,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:26:49,930 INFO L87 Difference]: Start difference. First operand 584 states and 887 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:53,326 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:26:55,331 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-27 15:26:57,361 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:26:59,384 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-27 15:27:01,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:27:03,437 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-27 15:27:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:04,752 INFO L93 Difference]: Finished difference Result 1161 states and 1766 transitions. [2022-04-27 15:27:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:27:04,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-27 15:27:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 404 transitions. [2022-04-27 15:27:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 404 transitions. [2022-04-27 15:27:04,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 404 transitions. [2022-04-27 15:27:04,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 404 edges. 404 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:04,950 INFO L225 Difference]: With dead ends: 1161 [2022-04-27 15:27:04,950 INFO L226 Difference]: Without dead ends: 584 [2022-04-27 15:27:04,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 15:27:04,952 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 7 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 4 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:04,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 796 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 431 Invalid, 5 Unknown, 0 Unchecked, 11.8s Time] [2022-04-27 15:27:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-04-27 15:27:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2022-04-27 15:27:04,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:04,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5233160621761659) internal successors, (882), 579 states have internal predecessors, (882), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:04,985 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5233160621761659) internal successors, (882), 579 states have internal predecessors, (882), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:04,985 INFO L87 Difference]: Start difference. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5233160621761659) internal successors, (882), 579 states have internal predecessors, (882), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:04,995 INFO L93 Difference]: Finished difference Result 584 states and 886 transitions. [2022-04-27 15:27:04,995 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 886 transitions. [2022-04-27 15:27:04,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:04,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:04,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 584 states, 579 states have (on average 1.5233160621761659) internal successors, (882), 579 states have internal predecessors, (882), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 584 states. [2022-04-27 15:27:04,997 INFO L87 Difference]: Start difference. First operand has 584 states, 579 states have (on average 1.5233160621761659) internal successors, (882), 579 states have internal predecessors, (882), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 584 states. [2022-04-27 15:27:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:05,007 INFO L93 Difference]: Finished difference Result 584 states and 886 transitions. [2022-04-27 15:27:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 886 transitions. [2022-04-27 15:27:05,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:05,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:05,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:05,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.5233160621761659) internal successors, (882), 579 states have internal predecessors, (882), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 886 transitions. [2022-04-27 15:27:05,020 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 886 transitions. Word has length 133 [2022-04-27 15:27:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:05,020 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 886 transitions. [2022-04-27 15:27:05,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 886 transitions. [2022-04-27 15:27:05,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-27 15:27:05,021 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:05,022 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:05,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 15:27:05,022 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:05,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2056632949, now seen corresponding path program 1 times [2022-04-27 15:27:05,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:05,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909202249] [2022-04-27 15:27:05,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:05,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:27:05,332 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 15:27:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:27:05,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 15:27:05,569 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 15:27:05,569 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:27:05,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 15:27:05,572 INFO L356 BasicCegarLoop]: Path program 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] [2022-04-27 15:27:05,574 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:27:05,670 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:27:05,670 WARN L170 areAnnotationChecker]: SSLv3_server_methodENTRY has no Hoare annotation [2022-04-27 15:27:05,670 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 15:27:05,670 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 15:27:05,670 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 15:27:05,670 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 15:27:05,670 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-27 15:27:05,670 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-27 15:27:05,670 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-27 15:27:05,670 WARN L170 areAnnotationChecker]: ssl3_acceptENTRY has no Hoare annotation [2022-04-27 15:27:05,670 WARN L170 areAnnotationChecker]: ssl3_get_server_methodENTRY has no Hoare annotation [2022-04-27 15:27:05,670 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: L1747 has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: L1747 has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: L1145 has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: L1145 has no Hoare annotation [2022-04-27 15:27:05,671 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1747-1 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1145-2 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: ssl3_get_server_methodFINAL has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1063-1 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: SSLv3_server_methodFINAL has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1106 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1151 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1151 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-27 15:27:05,672 WARN L170 areAnnotationChecker]: SSLv3_server_methodEXIT has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1151-1 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1065-1 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1160 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1160 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: ssl3_acceptFINAL has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1166-2 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1166-2 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1166-2 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: ssl3_acceptEXIT has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1731 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1731 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1169 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1169 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1731-2 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1172 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1172 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1279 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1175 has no Hoare annotation [2022-04-27 15:27:05,673 WARN L170 areAnnotationChecker]: L1175 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1284 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1284 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1178 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1178 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1284-2 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1289 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1289 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1184 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1184 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1295 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1295 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1187 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1187 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1297 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1297 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1295-2 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1190 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1190 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1308 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1308 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1658 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-27 15:27:05,674 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1315 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1315 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1196 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1196 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1317 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1317 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1697 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1697 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1696-1 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1199 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1199 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1698 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1698 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1351-2 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1351-2 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1202 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1202 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1700 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1700 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1698-2 has no Hoare annotation [2022-04-27 15:27:05,675 WARN L170 areAnnotationChecker]: L1698-2 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1205 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1205 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1709 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1709 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1368 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1368 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1208 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1208 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1368-2 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1368-2 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1211 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1211 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1378 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1378 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1214 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1214 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1378-2 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1387-2 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1391 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1391 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1217 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1217 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-27 15:27:05,676 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1220 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1220 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1403-2 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1223 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1223 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1450 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1450 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1226 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1226 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1426 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1411 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1411 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1451 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1451 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1229 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1229 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1460 has no Hoare annotation [2022-04-27 15:27:05,677 WARN L170 areAnnotationChecker]: L1492 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1492 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1232 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1232 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1414-1 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1415 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1415 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1461 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1461 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1235 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1235 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1462 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1462 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1470 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1503 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1503 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1238 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1238 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1473 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1473 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-27 15:27:05,678 WARN L170 areAnnotationChecker]: L1503-2 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1521 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1521 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1241 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1241 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1420-2 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1420-2 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1526 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1526 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1244 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1244 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1542 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1542 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1247 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1247 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1250 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1250 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1553 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1553 has no Hoare annotation [2022-04-27 15:27:05,679 WARN L170 areAnnotationChecker]: L1253 has no Hoare annotation [2022-04-27 15:27:05,680 WARN L170 areAnnotationChecker]: L1253 has no Hoare annotation [2022-04-27 15:27:05,680 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-27 15:27:05,680 WARN L170 areAnnotationChecker]: L1256 has no Hoare annotation [2022-04-27 15:27:05,680 WARN L170 areAnnotationChecker]: L1256 has no Hoare annotation [2022-04-27 15:27:05,680 WARN L170 areAnnotationChecker]: L1564 has no Hoare annotation [2022-04-27 15:27:05,680 WARN L170 areAnnotationChecker]: L1564 has no Hoare annotation [2022-04-27 15:27:05,680 WARN L170 areAnnotationChecker]: L1259 has no Hoare annotation [2022-04-27 15:27:05,680 WARN L170 areAnnotationChecker]: L1259 has no Hoare annotation [2022-04-27 15:27:05,680 WARN L170 areAnnotationChecker]: L1564-2 has no Hoare annotation [2022-04-27 15:27:05,680 WARN L170 areAnnotationChecker]: L1564-2 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1574 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1574 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1585 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1585 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1265 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1265 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1574-2 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1592 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1592 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1268 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1268 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1592-2 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1592-2 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1619 has no Hoare annotation [2022-04-27 15:27:05,681 WARN L170 areAnnotationChecker]: L1619 has no Hoare annotation [2022-04-27 15:27:05,682 WARN L170 areAnnotationChecker]: L1618 has no Hoare annotation [2022-04-27 15:27:05,682 WARN L170 areAnnotationChecker]: L1618 has no Hoare annotation [2022-04-27 15:27:05,682 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-27 15:27:05,682 WARN L170 areAnnotationChecker]: L1275 has no Hoare annotation [2022-04-27 15:27:05,682 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-27 15:27:05,682 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-27 15:27:05,682 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-27 15:27:05,682 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-27 15:27:05,682 WARN L170 areAnnotationChecker]: L1630 has no Hoare annotation [2022-04-27 15:27:05,682 WARN L170 areAnnotationChecker]: L1630 has no Hoare annotation [2022-04-27 15:27:05,682 WARN L170 areAnnotationChecker]: L1644 has no Hoare annotation [2022-04-27 15:27:05,682 WARN L170 areAnnotationChecker]: L1644 has no Hoare annotation [2022-04-27 15:27:05,682 WARN L170 areAnnotationChecker]: L1640-1 has no Hoare annotation [2022-04-27 15:27:05,682 WARN L170 areAnnotationChecker]: L1630-2 has no Hoare annotation [2022-04-27 15:27:05,682 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 15:27:05,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:27:05 BoogieIcfgContainer [2022-04-27 15:27:05,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:27:05,684 INFO L158 Benchmark]: Toolchain (without parser) took 115313.41ms. Allocated memory was 209.7MB in the beginning and 343.9MB in the end (delta: 134.2MB). Free memory was 155.7MB in the beginning and 272.5MB in the end (delta: -116.8MB). Peak memory consumption was 182.4MB. Max. memory is 8.0GB. [2022-04-27 15:27:05,685 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 175.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:27:05,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.47ms. Allocated memory is still 209.7MB. Free memory was 155.5MB in the beginning and 160.8MB in the end (delta: -5.3MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2022-04-27 15:27:05,686 INFO L158 Benchmark]: Boogie Preprocessor took 99.28ms. Allocated memory is still 209.7MB. Free memory was 160.8MB in the beginning and 151.1MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 15:27:05,686 INFO L158 Benchmark]: RCFGBuilder took 3019.31ms. Allocated memory is still 209.7MB. Free memory was 151.1MB in the beginning and 109.6MB in the end (delta: 41.4MB). Peak memory consumption was 42.3MB. Max. memory is 8.0GB. [2022-04-27 15:27:05,686 INFO L158 Benchmark]: TraceAbstraction took 111616.65ms. Allocated memory was 209.7MB in the beginning and 343.9MB in the end (delta: 134.2MB). Free memory was 109.1MB in the beginning and 272.5MB in the end (delta: -163.4MB). Peak memory consumption was 135.9MB. Max. memory is 8.0GB. [2022-04-27 15:27:05,688 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 209.7MB. Free memory is still 175.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 562.47ms. Allocated memory is still 209.7MB. Free memory was 155.5MB in the beginning and 160.8MB in the end (delta: -5.3MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 99.28ms. Allocated memory is still 209.7MB. Free memory was 160.8MB in the beginning and 151.1MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 3019.31ms. Allocated memory is still 209.7MB. Free memory was 151.1MB in the beginning and 109.6MB in the end (delta: 41.4MB). Peak memory consumption was 42.3MB. Max. memory is 8.0GB. * TraceAbstraction took 111616.65ms. Allocated memory was 209.7MB in the beginning and 343.9MB in the end (delta: 134.2MB). Free memory was 109.1MB in the beginning and 272.5MB in the end (delta: -163.4MB). Peak memory consumption was 135.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1737]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1151. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=4294967304, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) VAL [init=1, s={-8:0}, SSLv3_server_data={4:0}] [L1112] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->info_callback={0:11}, skip=0, SSLv3_server_data={4:0}, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1160] EXPR s->cert VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=0, init=1, ret=10, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:11}, (s->s3)->tmp.reuse_message=4294967331, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->s3={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1373] COND FALSE !(ret <= 0) [L1378] s->hit VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->hit=6, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1378] COND TRUE s->hit [L1379] s->state = 8656 VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1383] s->init_num = 0 VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:11}, (s->s3)->tmp.reuse_message=4294967331, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0, tmp___9=-15] [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:11}, (s->s3)->tmp.reuse_message=4294967331, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1166] COND TRUE 1 VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=0, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1618] COND TRUE blastFlag == 5 VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=0, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1737] reach_error() VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=0, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 186 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 111.5s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 104.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 30 mSolverCounterUnknown, 1639 SdHoareTripleChecker+Valid, 72.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1639 mSDsluCounter, 11356 SdHoareTripleChecker+Invalid, 72.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6849 mSDsCounter, 614 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9771 IncrementalHoareTripleChecker+Invalid, 10415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 614 mSolverCounterUnsat, 4507 mSDtfsCounter, 9771 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=23, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 822 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2588 NumberOfCodeBlocks, 2588 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2430 ConstructedInterpolants, 0 QuantifiedInterpolants, 5824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 1304/1304 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-27 15:27:05,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...