/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.04.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:25:30,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:25:30,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:25:30,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:25:30,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:25:30,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:25:30,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:25:30,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:25:30,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:25:30,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:25:30,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:25:30,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:25:30,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:25:30,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:25:30,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:25:30,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:25:30,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:25:30,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:25:30,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:25:30,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:25:30,411 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:25:30,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:25:30,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:25:30,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:25:30,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:25:30,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:25:30,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:25:30,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:25:30,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:25:30,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:25:30,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:25:30,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:25:30,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:25:30,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:25:30,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:25:30,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:25:30,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:25:30,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:25:30,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:25:30,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:25:30,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:25:30,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:25:30,426 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:30,447 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:25:30,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:25:30,447 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:25:30,447 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:25:30,448 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:25:30,448 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:25:30,448 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:25:30,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:25:30,448 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:25:30,449 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:25:30,449 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:25:30,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:25:30,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:25:30,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:25:30,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:25:30,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:25:30,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:25:30,449 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:25:30,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:25:30,450 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:25:30,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:25:30,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:25:30,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:25:30,450 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:25:30,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:25:30,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:25:30,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:25:30,450 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:25:30,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:25:30,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:25:30,451 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:25:30,451 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:25:30,451 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:25:30,451 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:30,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:25:30,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:25:30,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:25:30,648 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:25:30,649 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:25:30,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.04.i.cil.c [2022-04-27 15:25:30,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/145eac9dc/22cab818e76c4287858ac77ff0cecd62/FLAGb8420e1f8 [2022-04-27 15:25:31,131 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:25:31,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.04.i.cil.c [2022-04-27 15:25:31,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/145eac9dc/22cab818e76c4287858ac77ff0cecd62/FLAGb8420e1f8 [2022-04-27 15:25:31,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/145eac9dc/22cab818e76c4287858ac77ff0cecd62 [2022-04-27 15:25:31,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:25:31,674 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:25:31,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:25:31,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:25:31,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:25:31,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:25:31" (1/1) ... [2022-04-27 15:25:31,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fbd7d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:31, skipping insertion in model container [2022-04-27 15:25:31,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:25:31" (1/1) ... [2022-04-27 15:25:31,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:25:31,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:25:32,023 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.04.i.cil.c[72500,72513] [2022-04-27 15:25:32,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:25:32,046 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:25:32,125 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.04.i.cil.c[72500,72513] [2022-04-27 15:25:32,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:25:32,151 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:25:32,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:32 WrapperNode [2022-04-27 15:25:32,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:25:32,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:25:32,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:25:32,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:25:32,159 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:32" (1/1) ... [2022-04-27 15:25:32,159 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:32" (1/1) ... [2022-04-27 15:25:32,177 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:32" (1/1) ... [2022-04-27 15:25:32,178 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:32" (1/1) ... [2022-04-27 15:25:32,239 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:32" (1/1) ... [2022-04-27 15:25:32,244 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:32" (1/1) ... [2022-04-27 15:25:32,246 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:32" (1/1) ... [2022-04-27 15:25:32,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:25:32,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:25:32,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:25:32,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:25:32,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:32" (1/1) ... [2022-04-27 15:25:32,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:25:32,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:25:32,282 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:32,294 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:32,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:25:32,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:25:32,321 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:25:32,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-27 15:25:32,323 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-27 15:25:32,323 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:25:32,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-27 15:25:32,323 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-27 15:25:32,323 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 15:25:32,323 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-27 15:25:32,323 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:25:32,323 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:25:32,323 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:25:32,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:25:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-27 15:25:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 15:25:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:25:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-27 15:25:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-27 15:25:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-27 15:25:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-27 15:25:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-27 15:25:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-27 15:25:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-27 15:25:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-27 15:25:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-27 15:25:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:25:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 15:25:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:25:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-27 15:25:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:25:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 15:25:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 15:25:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:25:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:25:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:25:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-27 15:25:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-27 15:25:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-27 15:25:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-27 15:25:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:25:32,443 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:25:32,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:25:34,768 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-27 15:25:35,294 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-27 15:25:35,294 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-27 15:25:35,304 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:25:35,318 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:25:35,318 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:25:35,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:25:35 BoogieIcfgContainer [2022-04-27 15:25:35,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:25:35,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:25:35,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:25:35,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:25:35,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:25:31" (1/3) ... [2022-04-27 15:25:35,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f07692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:25:35, skipping insertion in model container [2022-04-27 15:25:35,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:32" (2/3) ... [2022-04-27 15:25:35,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f07692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:25:35, skipping insertion in model container [2022-04-27 15:25:35,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:25:35" (3/3) ... [2022-04-27 15:25:35,327 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2022-04-27 15:25:35,337 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:25:35,337 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:25:35,372 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:25:35,377 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@188b76b7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@150289cb [2022-04-27 15:25:35,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:25:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 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:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 15:25:35,393 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:35,393 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:35,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:35,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:35,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2027838722, now seen corresponding path program 1 times [2022-04-27 15:25:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:35,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539947856] [2022-04-27 15:25:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:35,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:35,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:35,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {156#true} is VALID [2022-04-27 15:25:35,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-27 15:25:35,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #661#return; {156#true} is VALID [2022-04-27 15:25:35,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:35,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {156#true} is VALID [2022-04-27 15:25:35,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-27 15:25:35,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #661#return; {156#true} is VALID [2022-04-27 15:25:35,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret161 := main(); {156#true} is VALID [2022-04-27 15:25:35,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#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; {156#true} is VALID [2022-04-27 15:25:35,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {156#true} is VALID [2022-04-27 15:25:35,887 INFO L272 TraceCheckUtils]: 7: Hoare triple {156#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {156#true} is VALID [2022-04-27 15:25:35,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {156#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {161#(= 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)))); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:35,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {162#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-27 15:25:35,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {162#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {157#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {157#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {157#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {157#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {157#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {157#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {157#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {157#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {157#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {157#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {157#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {157#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {157#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {157#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {157#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {157#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {157#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {157#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {157#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {157#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {157#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {157#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {157#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-27 15:25:35,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {157#false} assume 8672 == #t~mem79;havoc #t~mem79; {157#false} is VALID [2022-04-27 15:25:35,901 INFO L290 TraceCheckUtils]: 49: Hoare triple {157#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {157#false} is VALID [2022-04-27 15:25:35,901 INFO L290 TraceCheckUtils]: 50: Hoare triple {157#false} assume 4 == ~blastFlag~0; {157#false} is VALID [2022-04-27 15:25:35,901 INFO L290 TraceCheckUtils]: 51: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-27 15:25:35,902 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:35,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:35,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539947856] [2022-04-27 15:25:35,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539947856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:35,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:35,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:35,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416515115] [2022-04-27 15:25:35,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:35,908 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:35,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:35,912 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:35,967 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:35,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:35,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:35,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:35,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:35,998 INFO L87 Difference]: Start difference. First operand has 153 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 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:38,041 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,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:39,269 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2022-04-27 15:25:39,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:39,269 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:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:39,271 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:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-27 15:25:39,281 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:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-27 15:25:39,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 540 transitions. [2022-04-27 15:25:39,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 540 edges. 540 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:39,694 INFO L225 Difference]: With dead ends: 324 [2022-04-27 15:25:39,694 INFO L226 Difference]: Without dead ends: 165 [2022-04-27 15:25:39,696 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,699 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 34 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:39,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 577 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 401 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:25:39,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-27 15:25:39,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-04-27 15:25:39,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:39,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states 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,727 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states 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,727 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states 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,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:39,733 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-27 15:25:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-27 15:25:39,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:39,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:39,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-27 15:25:39,735 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-27 15:25:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:39,740 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-27 15:25:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-27 15:25:39,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:39,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:39,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:39,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states 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,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 224 transitions. [2022-04-27 15:25:39,746 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 224 transitions. Word has length 52 [2022-04-27 15:25:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:39,746 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 224 transitions. [2022-04-27 15:25:39,747 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:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 224 transitions. [2022-04-27 15:25:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 15:25:39,748 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:39,748 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:39,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:25:39,749 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:39,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:39,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1075038228, now seen corresponding path program 1 times [2022-04-27 15:25:39,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:39,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018251276] [2022-04-27 15:25:39,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:39,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:39,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:39,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {1072#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {1065#true} is VALID [2022-04-27 15:25:39,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {1065#true} assume true; {1065#true} is VALID [2022-04-27 15:25:39,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1065#true} {1065#true} #661#return; {1065#true} is VALID [2022-04-27 15:25:39,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {1065#true} call ULTIMATE.init(); {1072#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {1065#true} is VALID [2022-04-27 15:25:39,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {1065#true} assume true; {1065#true} is VALID [2022-04-27 15:25:39,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1065#true} {1065#true} #661#return; {1065#true} is VALID [2022-04-27 15:25:39,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {1065#true} call #t~ret161 := main(); {1065#true} is VALID [2022-04-27 15:25:39,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {1065#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; {1065#true} is VALID [2022-04-27 15:25:39,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {1065#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1065#true} is VALID [2022-04-27 15:25:39,945 INFO L272 TraceCheckUtils]: 7: Hoare triple {1065#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1065#true} is VALID [2022-04-27 15:25:39,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {1065#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:39,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:39,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:39,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {1070#(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)))); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:39,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:39,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:39,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:39,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:39,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:39,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:39,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:39,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:25:39,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1071#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-27 15:25:39,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {1071#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {1066#false} is VALID [2022-04-27 15:25:39,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {1066#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {1066#false} is VALID [2022-04-27 15:25:39,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {1066#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {1066#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {1066#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1066#false} is VALID [2022-04-27 15:25:39,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {1066#false} ~skip~0 := 0; {1066#false} is VALID [2022-04-27 15:25:39,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {1066#false} assume !false; {1066#false} is VALID [2022-04-27 15:25:39,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {1066#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {1066#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {1066#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {1066#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {1066#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {1066#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {1066#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {1066#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {1066#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {1066#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {1066#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {1066#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,955 INFO L290 TraceCheckUtils]: 40: Hoare triple {1066#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,955 INFO L290 TraceCheckUtils]: 41: Hoare triple {1066#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,955 INFO L290 TraceCheckUtils]: 42: Hoare triple {1066#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,955 INFO L290 TraceCheckUtils]: 43: Hoare triple {1066#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,955 INFO L290 TraceCheckUtils]: 44: Hoare triple {1066#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,956 INFO L290 TraceCheckUtils]: 45: Hoare triple {1066#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,956 INFO L290 TraceCheckUtils]: 46: Hoare triple {1066#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,956 INFO L290 TraceCheckUtils]: 47: Hoare triple {1066#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,956 INFO L290 TraceCheckUtils]: 48: Hoare triple {1066#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,956 INFO L290 TraceCheckUtils]: 49: Hoare triple {1066#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {1066#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {1066#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,956 INFO L290 TraceCheckUtils]: 52: Hoare triple {1066#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {1066#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {1066#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,957 INFO L290 TraceCheckUtils]: 55: Hoare triple {1066#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,957 INFO L290 TraceCheckUtils]: 56: Hoare triple {1066#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,957 INFO L290 TraceCheckUtils]: 57: Hoare triple {1066#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,957 INFO L290 TraceCheckUtils]: 58: Hoare triple {1066#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,957 INFO L290 TraceCheckUtils]: 59: Hoare triple {1066#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,957 INFO L290 TraceCheckUtils]: 60: Hoare triple {1066#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-27 15:25:39,958 INFO L290 TraceCheckUtils]: 61: Hoare triple {1066#false} assume 8672 == #t~mem79;havoc #t~mem79; {1066#false} is VALID [2022-04-27 15:25:39,958 INFO L290 TraceCheckUtils]: 62: Hoare triple {1066#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {1066#false} is VALID [2022-04-27 15:25:39,958 INFO L290 TraceCheckUtils]: 63: Hoare triple {1066#false} assume 4 == ~blastFlag~0; {1066#false} is VALID [2022-04-27 15:25:39,958 INFO L290 TraceCheckUtils]: 64: Hoare triple {1066#false} assume !false; {1066#false} is VALID [2022-04-27 15:25:39,958 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:39,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:39,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018251276] [2022-04-27 15:25:39,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018251276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:39,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:39,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:39,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497874411] [2022-04-27 15:25:39,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:39,960 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:39,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:39,961 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:40,006 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:40,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:40,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:40,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:40,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:40,007 INFO L87 Difference]: Start difference. First operand 148 states and 224 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:42,046 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:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:43,488 INFO L93 Difference]: Finished difference Result 383 states and 584 transitions. [2022-04-27 15:25:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:43,489 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:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:43,489 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:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-27 15:25:43,500 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:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-27 15:25:43,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 565 transitions. [2022-04-27 15:25:43,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 565 edges. 565 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:43,902 INFO L225 Difference]: With dead ends: 383 [2022-04-27 15:25:43,902 INFO L226 Difference]: Without dead ends: 261 [2022-04-27 15:25:43,902 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,903 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 135 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:43,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 580 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 600 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 15:25:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-27 15:25:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 164. [2022-04-27 15:25:43,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:43,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 164 states, 159 states have (on average 1.5408805031446542) internal successors, (245), 159 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:43,911 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 164 states, 159 states have (on average 1.5408805031446542) internal successors, (245), 159 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:43,912 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 164 states, 159 states have (on average 1.5408805031446542) internal successors, (245), 159 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:43,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:43,919 INFO L93 Difference]: Finished difference Result 261 states and 396 transitions. [2022-04-27 15:25:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 396 transitions. [2022-04-27 15:25:43,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:43,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:43,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.5408805031446542) internal successors, (245), 159 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 261 states. [2022-04-27 15:25:43,920 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.5408805031446542) internal successors, (245), 159 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 261 states. [2022-04-27 15:25:43,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:43,927 INFO L93 Difference]: Finished difference Result 261 states and 396 transitions. [2022-04-27 15:25:43,927 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 396 transitions. [2022-04-27 15:25:43,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:43,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:43,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:43,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.5408805031446542) internal successors, (245), 159 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:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 249 transitions. [2022-04-27 15:25:43,932 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 249 transitions. Word has length 65 [2022-04-27 15:25:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:43,932 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 249 transitions. [2022-04-27 15:25:43,932 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:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 249 transitions. [2022-04-27 15:25:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 15:25:43,933 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:43,933 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] [2022-04-27 15:25:43,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:25:43,934 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:43,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:43,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1045469476, now seen corresponding path program 1 times [2022-04-27 15:25:43,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:43,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351937694] [2022-04-27 15:25:43,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:43,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:44,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:44,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {2261#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {2254#true} is VALID [2022-04-27 15:25:44,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-27 15:25:44,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2254#true} {2254#true} #661#return; {2254#true} is VALID [2022-04-27 15:25:44,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {2254#true} call ULTIMATE.init(); {2261#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:44,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {2261#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {2254#true} is VALID [2022-04-27 15:25:44,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-27 15:25:44,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2254#true} {2254#true} #661#return; {2254#true} is VALID [2022-04-27 15:25:44,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {2254#true} call #t~ret161 := main(); {2254#true} is VALID [2022-04-27 15:25:44,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {2254#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; {2254#true} is VALID [2022-04-27 15:25:44,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {2254#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2254#true} is VALID [2022-04-27 15:25:44,048 INFO L272 TraceCheckUtils]: 7: Hoare triple {2254#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2254#true} is VALID [2022-04-27 15:25:44,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {2254#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2259#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:44,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {2259#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {2259#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:44,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {2259#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {2259#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:44,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {2259#(= 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)))); {2259#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:44,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {2259#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {2259#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:44,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {2259#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {2259#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:44,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {2259#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {2259#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:44,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {2259#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2260#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-27 15:25:44,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {2260#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {2255#false} is VALID [2022-04-27 15:25:44,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {2255#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {2255#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {2255#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2255#false} is VALID [2022-04-27 15:25:44,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {2255#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {2255#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {2255#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {2255#false} is VALID [2022-04-27 15:25:44,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {2255#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {2255#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {2255#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {2255#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {2255#false} is VALID [2022-04-27 15:25:44,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {2255#false} ~skip~0 := 0; {2255#false} is VALID [2022-04-27 15:25:44,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {2255#false} assume !false; {2255#false} is VALID [2022-04-27 15:25:44,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {2255#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {2255#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {2255#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {2255#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {2255#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {2255#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {2255#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {2255#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {2255#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {2255#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {2255#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {2255#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {2255#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {2255#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {2255#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {2255#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {2255#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {2255#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {2255#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {2255#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {2255#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {2255#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,056 INFO L290 TraceCheckUtils]: 51: Hoare triple {2255#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {2255#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {2255#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {2255#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,057 INFO L290 TraceCheckUtils]: 55: Hoare triple {2255#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {2255#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {2255#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {2255#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {2255#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,057 INFO L290 TraceCheckUtils]: 60: Hoare triple {2255#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {2255#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {2255#false} is VALID [2022-04-27 15:25:44,058 INFO L290 TraceCheckUtils]: 62: Hoare triple {2255#false} assume 8672 == #t~mem79;havoc #t~mem79; {2255#false} is VALID [2022-04-27 15:25:44,058 INFO L290 TraceCheckUtils]: 63: Hoare triple {2255#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {2255#false} is VALID [2022-04-27 15:25:44,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {2255#false} assume 4 == ~blastFlag~0; {2255#false} is VALID [2022-04-27 15:25:44,058 INFO L290 TraceCheckUtils]: 65: Hoare triple {2255#false} assume !false; {2255#false} is VALID [2022-04-27 15:25:44,058 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:44,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:44,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351937694] [2022-04-27 15:25:44,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351937694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:44,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:44,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:44,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444115020] [2022-04-27 15:25:44,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:44,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-27 15:25:44,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:44,060 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:44,101 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:44,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:44,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:44,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:44,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:44,102 INFO L87 Difference]: Start difference. First operand 164 states and 249 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:47,499 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:49,505 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:51,525 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:53,542 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:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:54,417 INFO L93 Difference]: Finished difference Result 318 states and 481 transitions. [2022-04-27 15:25:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:54,417 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:54,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:54,418 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:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-27 15:25:54,420 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:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-27 15:25:54,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 429 transitions. [2022-04-27 15:25:54,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:54,676 INFO L225 Difference]: With dead ends: 318 [2022-04-27 15:25:54,676 INFO L226 Difference]: Without dead ends: 180 [2022-04-27 15:25:54,677 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:54,678 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 28 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:54,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 455 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 349 Invalid, 3 Unknown, 0 Unchecked, 7.7s Time] [2022-04-27 15:25:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-27 15:25:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 164. [2022-04-27 15:25:54,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:54,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 164 states, 159 states have (on average 1.5345911949685536) internal successors, (244), 159 states have internal predecessors, (244), 3 states have call successors, (3), 3 states 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,685 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 164 states, 159 states have (on average 1.5345911949685536) internal successors, (244), 159 states have internal predecessors, (244), 3 states have call successors, (3), 3 states 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,685 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 164 states, 159 states have (on average 1.5345911949685536) internal successors, (244), 159 states have internal predecessors, (244), 3 states have call successors, (3), 3 states 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,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:54,691 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-27 15:25:54,691 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-27 15:25:54,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:54,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:54,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.5345911949685536) internal successors, (244), 159 states have internal predecessors, (244), 3 states have call successors, (3), 3 states 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:54,692 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.5345911949685536) internal successors, (244), 159 states have internal predecessors, (244), 3 states have call successors, (3), 3 states 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:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:54,695 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-27 15:25:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-27 15:25:54,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:54,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:54,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:54,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:54,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.5345911949685536) internal successors, (244), 159 states have internal predecessors, (244), 3 states have call successors, (3), 3 states 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,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 248 transitions. [2022-04-27 15:25:54,699 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 248 transitions. Word has length 66 [2022-04-27 15:25:54,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:54,699 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 248 transitions. [2022-04-27 15:25:54,699 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:54,699 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 248 transitions. [2022-04-27 15:25:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 15:25:54,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:54,700 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] [2022-04-27 15:25:54,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:25:54,700 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:54,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash -207458704, now seen corresponding path program 1 times [2022-04-27 15:25:54,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:54,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896993827] [2022-04-27 15:25:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:54,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:54,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:54,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {3208#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {3201#true} is VALID [2022-04-27 15:25:54,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {3201#true} assume true; {3201#true} is VALID [2022-04-27 15:25:54,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3201#true} {3201#true} #661#return; {3201#true} is VALID [2022-04-27 15:25:54,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {3201#true} call ULTIMATE.init(); {3208#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {3208#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {3201#true} is VALID [2022-04-27 15:25:54,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {3201#true} assume true; {3201#true} is VALID [2022-04-27 15:25:54,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3201#true} {3201#true} #661#return; {3201#true} is VALID [2022-04-27 15:25:54,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {3201#true} call #t~ret161 := main(); {3201#true} is VALID [2022-04-27 15:25:54,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {3201#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; {3201#true} is VALID [2022-04-27 15:25:54,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {3201#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3201#true} is VALID [2022-04-27 15:25:54,867 INFO L272 TraceCheckUtils]: 7: Hoare triple {3201#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3201#true} is VALID [2022-04-27 15:25:54,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {3201#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:54,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:54,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:54,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {3206#(= 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)))); {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:54,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:54,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:54,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:54,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:25:54,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {3206#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3207#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-27 15:25:54,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {3207#(= 8464 |ssl3_accept_#t~mem48|)} assume 16384 == #t~mem48;havoc #t~mem48; {3202#false} is VALID [2022-04-27 15:25:54,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {3202#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {3202#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3202#false} is VALID [2022-04-27 15:25:54,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {3202#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {3202#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {3202#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {3202#false} is VALID [2022-04-27 15:25:54,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {3202#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {3202#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {3202#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {3202#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3202#false} is VALID [2022-04-27 15:25:54,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {3202#false} ~skip~0 := 0; {3202#false} is VALID [2022-04-27 15:25:54,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {3202#false} assume !false; {3202#false} is VALID [2022-04-27 15:25:54,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {3202#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {3202#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {3202#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {3202#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {3202#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {3202#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {3202#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {3202#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {3202#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {3202#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,885 INFO L290 TraceCheckUtils]: 39: Hoare triple {3202#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {3202#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {3202#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {3202#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {3202#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {3202#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,886 INFO L290 TraceCheckUtils]: 45: Hoare triple {3202#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,886 INFO L290 TraceCheckUtils]: 46: Hoare triple {3202#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,886 INFO L290 TraceCheckUtils]: 47: Hoare triple {3202#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,886 INFO L290 TraceCheckUtils]: 48: Hoare triple {3202#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {3202#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,886 INFO L290 TraceCheckUtils]: 50: Hoare triple {3202#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,886 INFO L290 TraceCheckUtils]: 51: Hoare triple {3202#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,886 INFO L290 TraceCheckUtils]: 52: Hoare triple {3202#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,886 INFO L290 TraceCheckUtils]: 53: Hoare triple {3202#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,886 INFO L290 TraceCheckUtils]: 54: Hoare triple {3202#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,886 INFO L290 TraceCheckUtils]: 55: Hoare triple {3202#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,886 INFO L290 TraceCheckUtils]: 56: Hoare triple {3202#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,887 INFO L290 TraceCheckUtils]: 57: Hoare triple {3202#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,887 INFO L290 TraceCheckUtils]: 58: Hoare triple {3202#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,887 INFO L290 TraceCheckUtils]: 59: Hoare triple {3202#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,887 INFO L290 TraceCheckUtils]: 60: Hoare triple {3202#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,887 INFO L290 TraceCheckUtils]: 61: Hoare triple {3202#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {3202#false} is VALID [2022-04-27 15:25:54,887 INFO L290 TraceCheckUtils]: 62: Hoare triple {3202#false} assume 8672 == #t~mem79;havoc #t~mem79; {3202#false} is VALID [2022-04-27 15:25:54,887 INFO L290 TraceCheckUtils]: 63: Hoare triple {3202#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {3202#false} is VALID [2022-04-27 15:25:54,887 INFO L290 TraceCheckUtils]: 64: Hoare triple {3202#false} assume 4 == ~blastFlag~0; {3202#false} is VALID [2022-04-27 15:25:54,887 INFO L290 TraceCheckUtils]: 65: Hoare triple {3202#false} assume !false; {3202#false} is VALID [2022-04-27 15:25:54,887 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:54,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:54,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896993827] [2022-04-27 15:25:54,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896993827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:54,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:54,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:54,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504602088] [2022-04-27 15:25:54,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:54,888 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:54,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:54,889 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:54,932 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:54,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:54,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:54,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:54,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:54,933 INFO L87 Difference]: Start difference. First operand 164 states and 248 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:58,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:26:00,927 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:02,954 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:04,970 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:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:05,845 INFO L93 Difference]: Finished difference Result 318 states and 480 transitions. [2022-04-27 15:26:05,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:05,845 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:26:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:05,845 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:26:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-27 15:26:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-27 15:26:05,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 428 transitions. [2022-04-27 15:26:06,158 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:26:06,160 INFO L225 Difference]: With dead ends: 318 [2022-04-27 15:26:06,161 INFO L226 Difference]: Without dead ends: 180 [2022-04-27 15:26:06,161 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:06,162 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 26 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:06,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 455 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 349 Invalid, 3 Unknown, 0 Unchecked, 8.3s Time] [2022-04-27 15:26:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-27 15:26:06,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 164. [2022-04-27 15:26:06,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:06,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 164 states, 159 states have (on average 1.528301886792453) internal successors, (243), 159 states have internal predecessors, (243), 3 states have call successors, (3), 3 states 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:06,169 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 164 states, 159 states have (on average 1.528301886792453) internal successors, (243), 159 states have internal predecessors, (243), 3 states have call successors, (3), 3 states 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:06,169 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 164 states, 159 states have (on average 1.528301886792453) internal successors, (243), 159 states have internal predecessors, (243), 3 states have call successors, (3), 3 states 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:06,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:06,172 INFO L93 Difference]: Finished difference Result 180 states and 267 transitions. [2022-04-27 15:26:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 267 transitions. [2022-04-27 15:26:06,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:06,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:06,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.528301886792453) internal successors, (243), 159 states have internal predecessors, (243), 3 states have call successors, (3), 3 states 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:26:06,173 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.528301886792453) internal successors, (243), 159 states have internal predecessors, (243), 3 states have call successors, (3), 3 states 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:26:06,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:06,176 INFO L93 Difference]: Finished difference Result 180 states and 267 transitions. [2022-04-27 15:26:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 267 transitions. [2022-04-27 15:26:06,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:06,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:06,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:06,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.528301886792453) internal successors, (243), 159 states have internal predecessors, (243), 3 states have call successors, (3), 3 states 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:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 247 transitions. [2022-04-27 15:26:06,179 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 247 transitions. Word has length 66 [2022-04-27 15:26:06,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:06,179 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 247 transitions. [2022-04-27 15:26:06,179 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:26:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 247 transitions. [2022-04-27 15:26:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 15:26:06,180 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:06,180 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:26:06,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:26:06,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1867256871, now seen corresponding path program 1 times [2022-04-27 15:26:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:06,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905960009] [2022-04-27 15:26:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:06,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:06,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:06,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {4155#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {4148#true} is VALID [2022-04-27 15:26:06,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-27 15:26:06,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4148#true} {4148#true} #661#return; {4148#true} is VALID [2022-04-27 15:26:06,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4155#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:06,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {4155#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {4148#true} is VALID [2022-04-27 15:26:06,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-27 15:26:06,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4148#true} {4148#true} #661#return; {4148#true} is VALID [2022-04-27 15:26:06,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {4148#true} call #t~ret161 := main(); {4148#true} is VALID [2022-04-27 15:26:06,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {4148#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; {4148#true} is VALID [2022-04-27 15:26:06,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {4148#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4148#true} is VALID [2022-04-27 15:26:06,304 INFO L272 TraceCheckUtils]: 7: Hoare triple {4148#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4148#true} is VALID [2022-04-27 15:26:06,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:26:06,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:26:06,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:26:06,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:26:06,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:26:06,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:26:06,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:26:06,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:26:06,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:26:06,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:26:06,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:26:06,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:26:06,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:26:06,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {4153#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4154#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-27 15:26:06,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {4154#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {4149#false} is VALID [2022-04-27 15:26:06,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {4149#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {4149#false} is VALID [2022-04-27 15:26:06,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {4149#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {4149#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {4149#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {4149#false} ~skip~0 := 0; {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {4149#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {4149#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {4149#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {4149#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {4149#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {4149#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {4149#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {4149#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {4149#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 38: Hoare triple {4149#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 39: Hoare triple {4149#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 40: Hoare triple {4149#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {4149#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {4149#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 43: Hoare triple {4149#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {4149#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {4149#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {4149#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 50: Hoare triple {4149#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 51: Hoare triple {4149#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 55: Hoare triple {4149#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,312 INFO L290 TraceCheckUtils]: 56: Hoare triple {4149#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,313 INFO L290 TraceCheckUtils]: 57: Hoare triple {4149#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,313 INFO L290 TraceCheckUtils]: 58: Hoare triple {4149#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,313 INFO L290 TraceCheckUtils]: 59: Hoare triple {4149#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,313 INFO L290 TraceCheckUtils]: 60: Hoare triple {4149#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,313 INFO L290 TraceCheckUtils]: 61: Hoare triple {4149#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {4149#false} is VALID [2022-04-27 15:26:06,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {4149#false} assume 8672 == #t~mem79;havoc #t~mem79; {4149#false} is VALID [2022-04-27 15:26:06,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {4149#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {4149#false} is VALID [2022-04-27 15:26:06,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {4149#false} assume 4 == ~blastFlag~0; {4149#false} is VALID [2022-04-27 15:26:06,313 INFO L290 TraceCheckUtils]: 65: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-27 15:26:06,314 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:26:06,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:06,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905960009] [2022-04-27 15:26:06,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905960009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:06,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:06,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:06,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13703488] [2022-04-27 15:26:06,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:06,316 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:26:06,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:06,316 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:26:06,364 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:26:06,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:06,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:06,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:06,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:06,365 INFO L87 Difference]: Start difference. First operand 164 states and 247 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:26:09,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:26:11,988 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:14,010 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:16,027 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:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:17,116 INFO L93 Difference]: Finished difference Result 415 states and 633 transitions. [2022-04-27 15:26:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:17,116 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:26:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:17,117 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:26:17,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-27 15:26:17,120 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:26:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-27 15:26:17,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 565 transitions. [2022-04-27 15:26:17,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 565 edges. 565 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:17,499 INFO L225 Difference]: With dead ends: 415 [2022-04-27 15:26:17,499 INFO L226 Difference]: Without dead ends: 277 [2022-04-27 15:26:17,500 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:17,502 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 134 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 64 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:17,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 312 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 464 Invalid, 3 Unknown, 0 Unchecked, 8.0s Time] [2022-04-27 15:26:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-04-27 15:26:17,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 181. [2022-04-27 15:26:17,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:17,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand has 181 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 176 states have internal predecessors, (270), 3 states have call successors, (3), 3 states 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,518 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand has 181 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 176 states have internal predecessors, (270), 3 states have call successors, (3), 3 states 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,519 INFO L87 Difference]: Start difference. First operand 277 states. Second operand has 181 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 176 states have internal predecessors, (270), 3 states have call successors, (3), 3 states 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,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:17,528 INFO L93 Difference]: Finished difference Result 277 states and 419 transitions. [2022-04-27 15:26:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 419 transitions. [2022-04-27 15:26:17,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:17,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:17,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 176 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 277 states. [2022-04-27 15:26:17,530 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 176 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 277 states. [2022-04-27 15:26:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:17,534 INFO L93 Difference]: Finished difference Result 277 states and 419 transitions. [2022-04-27 15:26:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 419 transitions. [2022-04-27 15:26:17,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:17,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:17,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:17,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 176 states have internal predecessors, (270), 3 states have call successors, (3), 3 states 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,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 274 transitions. [2022-04-27 15:26:17,538 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 274 transitions. Word has length 66 [2022-04-27 15:26:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:17,540 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 274 transitions. [2022-04-27 15:26:17,540 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:26:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 274 transitions. [2022-04-27 15:26:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 15:26:17,541 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:17,541 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:26:17,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:26:17,542 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1927058904, now seen corresponding path program 1 times [2022-04-27 15:26:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:17,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709035714] [2022-04-27 15:26:17,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:17,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:17,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:17,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {5431#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {5424#true} is VALID [2022-04-27 15:26:17,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {5424#true} assume true; {5424#true} is VALID [2022-04-27 15:26:17,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5424#true} {5424#true} #661#return; {5424#true} is VALID [2022-04-27 15:26:17,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {5424#true} call ULTIMATE.init(); {5431#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:17,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {5431#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {5424#true} is VALID [2022-04-27 15:26:17,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {5424#true} assume true; {5424#true} is VALID [2022-04-27 15:26:17,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5424#true} {5424#true} #661#return; {5424#true} is VALID [2022-04-27 15:26:17,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {5424#true} call #t~ret161 := main(); {5424#true} is VALID [2022-04-27 15:26:17,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {5424#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; {5424#true} is VALID [2022-04-27 15:26:17,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {5424#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5424#true} is VALID [2022-04-27 15:26:17,673 INFO L272 TraceCheckUtils]: 7: Hoare triple {5424#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5424#true} is VALID [2022-04-27 15:26:17,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {5424#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:17,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:17,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:17,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {5429#(= 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)))); {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:17,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:17,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:17,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:17,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:17,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:17,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:17,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:17,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:17,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:17,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:17,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {5429#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5430#(= 8464 |ssl3_accept_#t~mem54|)} is VALID [2022-04-27 15:26:17,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {5430#(= 8464 |ssl3_accept_#t~mem54|)} assume 8482 == #t~mem54;havoc #t~mem54; {5425#false} is VALID [2022-04-27 15:26:17,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {5425#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {5425#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {5425#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5425#false} is VALID [2022-04-27 15:26:17,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {5425#false} ~skip~0 := 0; {5425#false} is VALID [2022-04-27 15:26:17,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {5425#false} assume !false; {5425#false} is VALID [2022-04-27 15:26:17,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {5425#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {5425#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {5425#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {5425#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {5425#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {5425#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {5425#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {5425#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {5425#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {5425#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {5425#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,691 INFO L290 TraceCheckUtils]: 40: Hoare triple {5425#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,692 INFO L290 TraceCheckUtils]: 41: Hoare triple {5425#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,692 INFO L290 TraceCheckUtils]: 42: Hoare triple {5425#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,692 INFO L290 TraceCheckUtils]: 43: Hoare triple {5425#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,693 INFO L290 TraceCheckUtils]: 44: Hoare triple {5425#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {5425#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,693 INFO L290 TraceCheckUtils]: 46: Hoare triple {5425#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,693 INFO L290 TraceCheckUtils]: 47: Hoare triple {5425#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,693 INFO L290 TraceCheckUtils]: 48: Hoare triple {5425#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,693 INFO L290 TraceCheckUtils]: 49: Hoare triple {5425#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 50: Hoare triple {5425#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 51: Hoare triple {5425#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 52: Hoare triple {5425#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 53: Hoare triple {5425#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 54: Hoare triple {5425#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 55: Hoare triple {5425#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 56: Hoare triple {5425#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 57: Hoare triple {5425#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 58: Hoare triple {5425#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 59: Hoare triple {5425#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 60: Hoare triple {5425#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 61: Hoare triple {5425#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 62: Hoare triple {5425#false} assume 8672 == #t~mem79;havoc #t~mem79; {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 63: Hoare triple {5425#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {5425#false} is VALID [2022-04-27 15:26:17,695 INFO L290 TraceCheckUtils]: 64: Hoare triple {5425#false} assume 4 == ~blastFlag~0; {5425#false} is VALID [2022-04-27 15:26:17,696 INFO L290 TraceCheckUtils]: 65: Hoare triple {5425#false} assume !false; {5425#false} is VALID [2022-04-27 15:26:17,696 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:26:17,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:17,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709035714] [2022-04-27 15:26:17,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709035714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:17,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:17,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:17,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017169750] [2022-04-27 15:26:17,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:17,697 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:26:17,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:17,697 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:26:17,743 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:26:17,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:17,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:17,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:17,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:17,744 INFO L87 Difference]: Start difference. First operand 181 states and 274 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:26:19,765 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:20,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:20,615 INFO L93 Difference]: Finished difference Result 349 states and 531 transitions. [2022-04-27 15:26:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:20,616 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:26:20,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:20,616 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:26:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-27 15:26:20,618 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:26:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-27 15:26:20,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 423 transitions. [2022-04-27 15:26:20,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:20,881 INFO L225 Difference]: With dead ends: 349 [2022-04-27 15:26:20,881 INFO L226 Difference]: Without dead ends: 194 [2022-04-27 15:26:20,881 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:20,883 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 18 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:20,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:26:20,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-27 15:26:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2022-04-27 15:26:20,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:20,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states 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,889 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states 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,889 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states 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,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:20,893 INFO L93 Difference]: Finished difference Result 194 states and 290 transitions. [2022-04-27 15:26:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2022-04-27 15:26:20,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:20,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:20,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-27 15:26:20,894 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-27 15:26:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:20,897 INFO L93 Difference]: Finished difference Result 194 states and 290 transitions. [2022-04-27 15:26:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2022-04-27 15:26:20,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:20,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:20,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:20,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:20,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states 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,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 273 transitions. [2022-04-27 15:26:20,900 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 273 transitions. Word has length 66 [2022-04-27 15:26:20,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:20,900 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 273 transitions. [2022-04-27 15:26:20,900 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:26:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 273 transitions. [2022-04-27 15:26:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-27 15:26:20,902 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:20,902 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] [2022-04-27 15:26:20,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:26:20,903 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:20,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:20,903 INFO L85 PathProgramCache]: Analyzing trace with hash 527212629, now seen corresponding path program 1 times [2022-04-27 15:26:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:20,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407043477] [2022-04-27 15:26:20,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:20,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:21,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:21,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {6458#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {6451#true} is VALID [2022-04-27 15:26:21,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {6451#true} assume true; {6451#true} is VALID [2022-04-27 15:26:21,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6451#true} {6451#true} #661#return; {6451#true} is VALID [2022-04-27 15:26:21,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {6451#true} call ULTIMATE.init(); {6458#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {6458#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {6451#true} is VALID [2022-04-27 15:26:21,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {6451#true} assume true; {6451#true} is VALID [2022-04-27 15:26:21,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6451#true} {6451#true} #661#return; {6451#true} is VALID [2022-04-27 15:26:21,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {6451#true} call #t~ret161 := main(); {6451#true} is VALID [2022-04-27 15:26:21,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {6451#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; {6451#true} is VALID [2022-04-27 15:26:21,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {6451#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6451#true} is VALID [2022-04-27 15:26:21,018 INFO L272 TraceCheckUtils]: 7: Hoare triple {6451#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6451#true} is VALID [2022-04-27 15:26:21,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {6451#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {6456#(= 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)))); {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:21,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {6456#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6457#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-27 15:26:21,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {6457#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {6452#false} is VALID [2022-04-27 15:26:21,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {6452#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {6452#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6452#false} is VALID [2022-04-27 15:26:21,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {6452#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {6452#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {6452#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {6452#false} is VALID [2022-04-27 15:26:21,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {6452#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {6452#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {6452#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {6452#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {6452#false} is VALID [2022-04-27 15:26:21,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {6452#false} ~skip~0 := 0; {6452#false} is VALID [2022-04-27 15:26:21,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {6452#false} assume !false; {6452#false} is VALID [2022-04-27 15:26:21,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {6452#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {6452#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {6452#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 33: Hoare triple {6452#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {6452#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {6452#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {6452#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {6452#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 38: Hoare triple {6452#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 39: Hoare triple {6452#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {6452#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {6452#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {6452#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 43: Hoare triple {6452#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 44: Hoare triple {6452#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 45: Hoare triple {6452#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 46: Hoare triple {6452#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 47: Hoare triple {6452#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 48: Hoare triple {6452#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 49: Hoare triple {6452#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {6452#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 51: Hoare triple {6452#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 52: Hoare triple {6452#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 53: Hoare triple {6452#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 54: Hoare triple {6452#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 55: Hoare triple {6452#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 56: Hoare triple {6452#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {6452#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {6452#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {6452#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {6452#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 61: Hoare triple {6452#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 62: Hoare triple {6452#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 63: Hoare triple {6452#false} assume 8672 == #t~mem79;havoc #t~mem79; {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 64: Hoare triple {6452#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 65: Hoare triple {6452#false} assume 4 == ~blastFlag~0; {6452#false} is VALID [2022-04-27 15:26:21,026 INFO L290 TraceCheckUtils]: 66: Hoare triple {6452#false} assume !false; {6452#false} is VALID [2022-04-27 15:26:21,026 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:26:21,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:21,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407043477] [2022-04-27 15:26:21,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407043477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:21,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:21,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:21,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543652921] [2022-04-27 15:26:21,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:21,028 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:26:21,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:21,028 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:26:21,079 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:26:21,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:21,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:21,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:21,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:21,080 INFO L87 Difference]: Start difference. First operand 181 states and 273 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:26:23,101 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:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:23,993 INFO L93 Difference]: Finished difference Result 349 states and 530 transitions. [2022-04-27 15:26:23,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:23,994 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:26:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:23,994 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:26:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2022-04-27 15:26:23,997 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:26:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2022-04-27 15:26:23,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 422 transitions. [2022-04-27 15:26:24,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:24,286 INFO L225 Difference]: With dead ends: 349 [2022-04-27 15:26:24,286 INFO L226 Difference]: Without dead ends: 194 [2022-04-27 15:26:24,286 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:24,287 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 22 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:24,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:26:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-27 15:26:24,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2022-04-27 15:26:24,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:24,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5227272727272727) internal successors, (268), 176 states have internal predecessors, (268), 3 states have call successors, (3), 3 states 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,291 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5227272727272727) internal successors, (268), 176 states have internal predecessors, (268), 3 states have call successors, (3), 3 states 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,291 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5227272727272727) internal successors, (268), 176 states have internal predecessors, (268), 3 states have call successors, (3), 3 states 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,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:24,294 INFO L93 Difference]: Finished difference Result 194 states and 289 transitions. [2022-04-27 15:26:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2022-04-27 15:26:24,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:24,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:24,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.5227272727272727) internal successors, (268), 176 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-27 15:26:24,295 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.5227272727272727) internal successors, (268), 176 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-27 15:26:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:24,297 INFO L93 Difference]: Finished difference Result 194 states and 289 transitions. [2022-04-27 15:26:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2022-04-27 15:26:24,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:24,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:24,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:24,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.5227272727272727) internal successors, (268), 176 states have internal predecessors, (268), 3 states have call successors, (3), 3 states 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,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 272 transitions. [2022-04-27 15:26:24,301 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 272 transitions. Word has length 67 [2022-04-27 15:26:24,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:24,301 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 272 transitions. [2022-04-27 15:26:24,302 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:26:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 272 transitions. [2022-04-27 15:26:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 15:26:24,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:24,302 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] [2022-04-27 15:26:24,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:26:24,302 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:24,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:24,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1788390677, now seen corresponding path program 1 times [2022-04-27 15:26:24,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:24,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395487622] [2022-04-27 15:26:24,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:24,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:24,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:24,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {7485#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {7478#true} is VALID [2022-04-27 15:26:24,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {7478#true} assume true; {7478#true} is VALID [2022-04-27 15:26:24,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7478#true} {7478#true} #661#return; {7478#true} is VALID [2022-04-27 15:26:24,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {7478#true} call ULTIMATE.init(); {7485#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:24,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {7485#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {7478#true} is VALID [2022-04-27 15:26:24,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {7478#true} assume true; {7478#true} is VALID [2022-04-27 15:26:24,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7478#true} {7478#true} #661#return; {7478#true} is VALID [2022-04-27 15:26:24,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {7478#true} call #t~ret161 := main(); {7478#true} is VALID [2022-04-27 15:26:24,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {7478#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; {7478#true} is VALID [2022-04-27 15:26:24,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {7478#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {7478#true} is VALID [2022-04-27 15:26:24,407 INFO L272 TraceCheckUtils]: 7: Hoare triple {7478#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7478#true} is VALID [2022-04-27 15:26:24,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {7478#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:24,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:24,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:24,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {7483#(= 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)))); {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:24,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:24,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:24,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:24,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:24,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:24,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:24,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {7483#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7484#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-27 15:26:24,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {7484#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {7479#false} is VALID [2022-04-27 15:26:24,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {7479#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {7479#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7479#false} is VALID [2022-04-27 15:26:24,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {7479#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {7479#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {7479#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {7479#false} is VALID [2022-04-27 15:26:24,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {7479#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {7479#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {7479#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {7479#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7479#false} is VALID [2022-04-27 15:26:24,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {7479#false} ~skip~0 := 0; {7479#false} is VALID [2022-04-27 15:26:24,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {7479#false} assume !false; {7479#false} is VALID [2022-04-27 15:26:24,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {7479#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {7479#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {7479#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {7479#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {7479#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {7479#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {7479#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {7479#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {7479#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {7479#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {7479#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 42: Hoare triple {7479#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 43: Hoare triple {7479#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {7479#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 45: Hoare triple {7479#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 46: Hoare triple {7479#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 47: Hoare triple {7479#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 48: Hoare triple {7479#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 49: Hoare triple {7479#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 50: Hoare triple {7479#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 51: Hoare triple {7479#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 52: Hoare triple {7479#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {7479#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 54: Hoare triple {7479#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 55: Hoare triple {7479#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 56: Hoare triple {7479#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 57: Hoare triple {7479#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,417 INFO L290 TraceCheckUtils]: 58: Hoare triple {7479#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,418 INFO L290 TraceCheckUtils]: 59: Hoare triple {7479#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,418 INFO L290 TraceCheckUtils]: 60: Hoare triple {7479#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,418 INFO L290 TraceCheckUtils]: 61: Hoare triple {7479#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,418 INFO L290 TraceCheckUtils]: 62: Hoare triple {7479#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,418 INFO L290 TraceCheckUtils]: 63: Hoare triple {7479#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {7479#false} is VALID [2022-04-27 15:26:24,418 INFO L290 TraceCheckUtils]: 64: Hoare triple {7479#false} assume 8672 == #t~mem79;havoc #t~mem79; {7479#false} is VALID [2022-04-27 15:26:24,418 INFO L290 TraceCheckUtils]: 65: Hoare triple {7479#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {7479#false} is VALID [2022-04-27 15:26:24,418 INFO L290 TraceCheckUtils]: 66: Hoare triple {7479#false} assume 4 == ~blastFlag~0; {7479#false} is VALID [2022-04-27 15:26:24,418 INFO L290 TraceCheckUtils]: 67: Hoare triple {7479#false} assume !false; {7479#false} is VALID [2022-04-27 15:26:24,418 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:26:24,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:24,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395487622] [2022-04-27 15:26:24,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395487622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:24,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:24,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:24,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948281650] [2022-04-27 15:26:24,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:24,419 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:26:24,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:24,419 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:26:24,466 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:26:24,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:24,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:24,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:24,467 INFO L87 Difference]: Start difference. First operand 181 states and 272 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:26:26,487 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:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:27,316 INFO L93 Difference]: Finished difference Result 349 states and 529 transitions. [2022-04-27 15:26:27,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:27,316 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:26:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:27,316 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:26:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2022-04-27 15:26:27,318 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:26:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2022-04-27 15:26:27,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 421 transitions. [2022-04-27 15:26:27,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:27,611 INFO L225 Difference]: With dead ends: 349 [2022-04-27 15:26:27,611 INFO L226 Difference]: Without dead ends: 194 [2022-04-27 15:26:27,612 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:27,612 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 20 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:27,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:26:27,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-27 15:26:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2022-04-27 15:26:27,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:27,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5170454545454546) internal successors, (267), 176 states have internal predecessors, (267), 3 states have call successors, (3), 3 states 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,616 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5170454545454546) internal successors, (267), 176 states have internal predecessors, (267), 3 states have call successors, (3), 3 states 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,616 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5170454545454546) internal successors, (267), 176 states have internal predecessors, (267), 3 states have call successors, (3), 3 states 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,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:27,620 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2022-04-27 15:26:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2022-04-27 15:26:27,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:27,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:27,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.5170454545454546) internal successors, (267), 176 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-27 15:26:27,621 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.5170454545454546) internal successors, (267), 176 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-27 15:26:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:27,624 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2022-04-27 15:26:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2022-04-27 15:26:27,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:27,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:27,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:27,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.5170454545454546) internal successors, (267), 176 states have internal predecessors, (267), 3 states have call successors, (3), 3 states 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,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 271 transitions. [2022-04-27 15:26:27,631 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 271 transitions. Word has length 68 [2022-04-27 15:26:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:27,631 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 271 transitions. [2022-04-27 15:26:27,632 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:26:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 271 transitions. [2022-04-27 15:26:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-27 15:26:27,636 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:27,636 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:27,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:26:27,636 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2103559590, now seen corresponding path program 1 times [2022-04-27 15:26:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:27,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101394226] [2022-04-27 15:26:27,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:27,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:27,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {8512#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {8505#true} is VALID [2022-04-27 15:26:27,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {8505#true} assume true; {8505#true} is VALID [2022-04-27 15:26:27,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8505#true} {8505#true} #661#return; {8505#true} is VALID [2022-04-27 15:26:27,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {8505#true} call ULTIMATE.init(); {8512#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:27,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {8512#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {8505#true} is VALID [2022-04-27 15:26:27,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {8505#true} assume true; {8505#true} is VALID [2022-04-27 15:26:27,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8505#true} {8505#true} #661#return; {8505#true} is VALID [2022-04-27 15:26:27,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {8505#true} call #t~ret161 := main(); {8505#true} is VALID [2022-04-27 15:26:27,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {8505#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; {8505#true} is VALID [2022-04-27 15:26:27,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {8505#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8505#true} is VALID [2022-04-27 15:26:27,736 INFO L272 TraceCheckUtils]: 7: Hoare triple {8505#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8505#true} is VALID [2022-04-27 15:26:27,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {8505#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:27,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:27,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:27,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {8510#(= 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)))); {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:27,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:27,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:27,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:27,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:27,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:27,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:27,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:27,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {8510#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8511#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-27 15:26:27,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {8511#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {8506#false} is VALID [2022-04-27 15:26:27,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {8506#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {8506#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {8506#false} is VALID [2022-04-27 15:26:27,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {8506#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {8506#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {8506#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {8506#false} is VALID [2022-04-27 15:26:27,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {8506#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {8506#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {8506#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {8506#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {8506#false} ~skip~0 := 0; {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {8506#false} assume !false; {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {8506#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {8506#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {8506#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {8506#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {8506#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {8506#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {8506#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {8506#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {8506#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {8506#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {8506#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {8506#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 44: Hoare triple {8506#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {8506#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 46: Hoare triple {8506#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 47: Hoare triple {8506#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {8506#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {8506#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 50: Hoare triple {8506#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {8506#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {8506#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {8506#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {8506#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {8506#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {8506#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {8506#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {8506#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {8506#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 60: Hoare triple {8506#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 61: Hoare triple {8506#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {8506#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 63: Hoare triple {8506#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 64: Hoare triple {8506#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {8506#false} assume 8672 == #t~mem79;havoc #t~mem79; {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 66: Hoare triple {8506#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 67: Hoare triple {8506#false} assume 4 == ~blastFlag~0; {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L290 TraceCheckUtils]: 68: Hoare triple {8506#false} assume !false; {8506#false} is VALID [2022-04-27 15:26:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:26:27,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:27,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101394226] [2022-04-27 15:26:27,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101394226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:27,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:27,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:27,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066851434] [2022-04-27 15:26:27,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:27,745 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:26:27,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:27,745 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:26:27,792 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:26:27,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:27,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:27,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:27,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:27,794 INFO L87 Difference]: Start difference. First operand 181 states and 271 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:26:29,813 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:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:30,614 INFO L93 Difference]: Finished difference Result 339 states and 515 transitions. [2022-04-27 15:26:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:30,615 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:26:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:30,615 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:26:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-27 15:26:30,618 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:26:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-27 15:26:30,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 407 transitions. [2022-04-27 15:26:30,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:30,900 INFO L225 Difference]: With dead ends: 339 [2022-04-27 15:26:30,900 INFO L226 Difference]: Without dead ends: 184 [2022-04-27 15:26:30,900 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:30,901 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:30,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 475 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:26:30,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-27 15:26:30,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2022-04-27 15:26:30,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:30,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 181 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 3 states have call successors, (3), 3 states 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,904 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 181 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 3 states have call successors, (3), 3 states 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,904 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 181 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 3 states have call successors, (3), 3 states 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,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:30,908 INFO L93 Difference]: Finished difference Result 184 states and 274 transitions. [2022-04-27 15:26:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 274 transitions. [2022-04-27 15:26:30,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:30,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:30,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 184 states. [2022-04-27 15:26:30,909 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 184 states. [2022-04-27 15:26:30,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:30,911 INFO L93 Difference]: Finished difference Result 184 states and 274 transitions. [2022-04-27 15:26:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 274 transitions. [2022-04-27 15:26:30,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:30,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:30,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:30,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 3 states have call successors, (3), 3 states 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,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 270 transitions. [2022-04-27 15:26:30,914 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 270 transitions. Word has length 69 [2022-04-27 15:26:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:30,914 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 270 transitions. [2022-04-27 15:26:30,914 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:26:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2022-04-27 15:26:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-27 15:26:30,915 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:30,915 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:26:30,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:26:30,915 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:30,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash 890818627, now seen corresponding path program 1 times [2022-04-27 15:26:30,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:30,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717335505] [2022-04-27 15:26:30,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:31,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:31,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {9508#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {9501#true} is VALID [2022-04-27 15:26:31,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {9501#true} assume true; {9501#true} is VALID [2022-04-27 15:26:31,022 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9501#true} {9501#true} #661#return; {9501#true} is VALID [2022-04-27 15:26:31,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {9501#true} call ULTIMATE.init(); {9508#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:31,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {9508#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {9501#true} is VALID [2022-04-27 15:26:31,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {9501#true} assume true; {9501#true} is VALID [2022-04-27 15:26:31,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9501#true} {9501#true} #661#return; {9501#true} is VALID [2022-04-27 15:26:31,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {9501#true} call #t~ret161 := main(); {9501#true} is VALID [2022-04-27 15:26:31,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {9501#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; {9501#true} is VALID [2022-04-27 15:26:31,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {9501#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9501#true} is VALID [2022-04-27 15:26:31,023 INFO L272 TraceCheckUtils]: 7: Hoare triple {9501#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9501#true} is VALID [2022-04-27 15:26:31,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {9501#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9501#true} is VALID [2022-04-27 15:26:31,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {9501#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9501#true} is VALID [2022-04-27 15:26:31,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {9501#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {9501#true} is VALID [2022-04-27 15:26:31,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {9501#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9501#true} is VALID [2022-04-27 15:26:31,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {9501#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9501#true} is VALID [2022-04-27 15:26:31,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {9501#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {9501#true} is VALID [2022-04-27 15:26:31,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {9501#true} assume !false; {9501#true} is VALID [2022-04-27 15:26:31,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {9501#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9501#true} is VALID [2022-04-27 15:26:31,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {9501#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9501#true} is VALID [2022-04-27 15:26:31,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {9501#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9501#true} is VALID [2022-04-27 15:26:31,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {9501#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9501#true} is VALID [2022-04-27 15:26:31,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {9501#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9501#true} is VALID [2022-04-27 15:26:31,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {9501#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9501#true} is VALID [2022-04-27 15:26:31,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {9501#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9501#true} is VALID [2022-04-27 15:26:31,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {9501#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9501#true} is VALID [2022-04-27 15:26:31,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {9501#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9501#true} is VALID [2022-04-27 15:26:31,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {9501#true} assume 8464 == #t~mem55;havoc #t~mem55; {9501#true} is VALID [2022-04-27 15:26:31,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {9501#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {9501#true} is VALID [2022-04-27 15:26:31,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {9501#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9501#true} is VALID [2022-04-27 15:26:31,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {9501#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); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,028 INFO L290 TraceCheckUtils]: 38: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,029 INFO L290 TraceCheckUtils]: 41: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,031 INFO L290 TraceCheckUtils]: 46: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,032 INFO L290 TraceCheckUtils]: 48: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,032 INFO L290 TraceCheckUtils]: 49: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,033 INFO L290 TraceCheckUtils]: 50: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,033 INFO L290 TraceCheckUtils]: 51: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,033 INFO L290 TraceCheckUtils]: 52: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,034 INFO L290 TraceCheckUtils]: 55: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,035 INFO L290 TraceCheckUtils]: 57: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,035 INFO L290 TraceCheckUtils]: 58: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,035 INFO L290 TraceCheckUtils]: 59: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,036 INFO L290 TraceCheckUtils]: 60: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,036 INFO L290 TraceCheckUtils]: 61: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,036 INFO L290 TraceCheckUtils]: 62: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,036 INFO L290 TraceCheckUtils]: 63: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:31,037 INFO L290 TraceCheckUtils]: 64: Hoare triple {9506#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {9507#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-27 15:26:31,037 INFO L290 TraceCheckUtils]: 65: Hoare triple {9507#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {9502#false} is VALID [2022-04-27 15:26:31,037 INFO L290 TraceCheckUtils]: 66: Hoare triple {9502#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {9502#false} is VALID [2022-04-27 15:26:31,037 INFO L290 TraceCheckUtils]: 67: Hoare triple {9502#false} assume 4 == ~blastFlag~0; {9502#false} is VALID [2022-04-27 15:26:31,037 INFO L290 TraceCheckUtils]: 68: Hoare triple {9502#false} assume !false; {9502#false} is VALID [2022-04-27 15:26:31,038 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:26:31,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:31,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717335505] [2022-04-27 15:26:31,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717335505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:31,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:31,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:31,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285799490] [2022-04-27 15:26:31,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:31,039 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:26:31,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:31,039 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:26:31,082 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:26:31,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:31,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:31,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:31,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:31,083 INFO L87 Difference]: Start difference. First operand 181 states and 270 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:26:35,498 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:37,518 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:39,540 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:40,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:40,582 INFO L93 Difference]: Finished difference Result 449 states and 682 transitions. [2022-04-27 15:26:40,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:40,582 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:26:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:40,583 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:26:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-27 15:26:40,586 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:26:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-27 15:26:40,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 564 transitions. [2022-04-27 15:26:40,981 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:40,985 INFO L225 Difference]: With dead ends: 449 [2022-04-27 15:26:40,985 INFO L226 Difference]: Without dead ends: 294 [2022-04-27 15:26:40,985 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:40,986 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 107 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 63 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:40,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 313 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 465 Invalid, 3 Unknown, 0 Unchecked, 6.8s Time] [2022-04-27 15:26:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-27 15:26:40,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 224. [2022-04-27 15:26:40,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:40,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 224 states, 219 states have (on average 1.5707762557077625) internal successors, (344), 219 states have internal predecessors, (344), 3 states have call successors, (3), 3 states 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:40,990 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 224 states, 219 states have (on average 1.5707762557077625) internal successors, (344), 219 states have internal predecessors, (344), 3 states have call successors, (3), 3 states 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:40,991 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 224 states, 219 states have (on average 1.5707762557077625) internal successors, (344), 219 states have internal predecessors, (344), 3 states have call successors, (3), 3 states 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:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:40,995 INFO L93 Difference]: Finished difference Result 294 states and 441 transitions. [2022-04-27 15:26:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 441 transitions. [2022-04-27 15:26:40,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:40,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:40,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 224 states, 219 states have (on average 1.5707762557077625) internal successors, (344), 219 states have internal predecessors, (344), 3 states have call successors, (3), 3 states 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:26:40,996 INFO L87 Difference]: Start difference. First operand has 224 states, 219 states have (on average 1.5707762557077625) internal successors, (344), 219 states have internal predecessors, (344), 3 states have call successors, (3), 3 states 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:26:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:41,000 INFO L93 Difference]: Finished difference Result 294 states and 441 transitions. [2022-04-27 15:26:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 441 transitions. [2022-04-27 15:26:41,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:41,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:41,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:41,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 219 states have (on average 1.5707762557077625) internal successors, (344), 219 states have internal predecessors, (344), 3 states have call successors, (3), 3 states 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,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 348 transitions. [2022-04-27 15:26:41,004 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 348 transitions. Word has length 69 [2022-04-27 15:26:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:41,004 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 348 transitions. [2022-04-27 15:26:41,005 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:26:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 348 transitions. [2022-04-27 15:26:41,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-27 15:26:41,005 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:41,005 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:26:41,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:26:41,005 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:41,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1838419001, now seen corresponding path program 1 times [2022-04-27 15:26:41,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:41,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904512606] [2022-04-27 15:26:41,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:41,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:41,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:41,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {10901#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {10894#true} is VALID [2022-04-27 15:26:41,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {10894#true} assume true; {10894#true} is VALID [2022-04-27 15:26:41,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10894#true} {10894#true} #661#return; {10894#true} is VALID [2022-04-27 15:26:41,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {10894#true} call ULTIMATE.init(); {10901#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:41,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {10901#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {10894#true} is VALID [2022-04-27 15:26:41,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {10894#true} assume true; {10894#true} is VALID [2022-04-27 15:26:41,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10894#true} {10894#true} #661#return; {10894#true} is VALID [2022-04-27 15:26:41,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {10894#true} call #t~ret161 := main(); {10894#true} is VALID [2022-04-27 15:26:41,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {10894#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; {10894#true} is VALID [2022-04-27 15:26:41,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {10894#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {10894#true} is VALID [2022-04-27 15:26:41,099 INFO L272 TraceCheckUtils]: 7: Hoare triple {10894#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10894#true} is VALID [2022-04-27 15:26:41,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {10894#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {10894#true} is VALID [2022-04-27 15:26:41,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {10894#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {10894#true} is VALID [2022-04-27 15:26:41,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {10894#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {10894#true} is VALID [2022-04-27 15:26:41,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {10894#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {10894#true} is VALID [2022-04-27 15:26:41,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {10894#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {10894#true} is VALID [2022-04-27 15:26:41,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {10894#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {10894#true} is VALID [2022-04-27 15:26:41,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {10894#true} assume !false; {10894#true} is VALID [2022-04-27 15:26:41,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {10894#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10894#true} is VALID [2022-04-27 15:26:41,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {10894#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10894#true} is VALID [2022-04-27 15:26:41,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {10894#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10894#true} is VALID [2022-04-27 15:26:41,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {10894#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10894#true} is VALID [2022-04-27 15:26:41,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {10894#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10894#true} is VALID [2022-04-27 15:26:41,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {10894#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10894#true} is VALID [2022-04-27 15:26:41,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {10894#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10894#true} is VALID [2022-04-27 15:26:41,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {10894#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10894#true} is VALID [2022-04-27 15:26:41,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {10894#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10894#true} is VALID [2022-04-27 15:26:41,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {10894#true} assume 8464 == #t~mem55;havoc #t~mem55; {10894#true} is VALID [2022-04-27 15:26:41,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {10894#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {10894#true} is VALID [2022-04-27 15:26:41,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {10894#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {10894#true} is VALID [2022-04-27 15:26:41,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {10894#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); {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {10899#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10900#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {10900#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {10895#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {10895#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {10895#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {10895#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {10895#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 50: Hoare triple {10895#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 51: Hoare triple {10895#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 52: Hoare triple {10895#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 53: Hoare triple {10895#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 54: Hoare triple {10895#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 55: Hoare triple {10895#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 56: Hoare triple {10895#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,122 INFO L290 TraceCheckUtils]: 57: Hoare triple {10895#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,123 INFO L290 TraceCheckUtils]: 58: Hoare triple {10895#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,123 INFO L290 TraceCheckUtils]: 59: Hoare triple {10895#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,123 INFO L290 TraceCheckUtils]: 60: Hoare triple {10895#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,123 INFO L290 TraceCheckUtils]: 61: Hoare triple {10895#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,123 INFO L290 TraceCheckUtils]: 62: Hoare triple {10895#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,123 INFO L290 TraceCheckUtils]: 63: Hoare triple {10895#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,123 INFO L290 TraceCheckUtils]: 64: Hoare triple {10895#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,123 INFO L290 TraceCheckUtils]: 65: Hoare triple {10895#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {10895#false} is VALID [2022-04-27 15:26:41,123 INFO L290 TraceCheckUtils]: 66: Hoare triple {10895#false} assume 8673 == #t~mem80;havoc #t~mem80; {10895#false} is VALID [2022-04-27 15:26:41,123 INFO L290 TraceCheckUtils]: 67: Hoare triple {10895#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {10895#false} is VALID [2022-04-27 15:26:41,123 INFO L290 TraceCheckUtils]: 68: Hoare triple {10895#false} assume 4 == ~blastFlag~0; {10895#false} is VALID [2022-04-27 15:26:41,123 INFO L290 TraceCheckUtils]: 69: Hoare triple {10895#false} assume !false; {10895#false} is VALID [2022-04-27 15:26:41,123 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:26:41,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:41,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904512606] [2022-04-27 15:26:41,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904512606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:41,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:41,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:41,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549546881] [2022-04-27 15:26:41,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:41,124 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:26:41,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:41,124 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:26:41,167 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:26:41,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:41,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:41,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:41,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:41,168 INFO L87 Difference]: Start difference. First operand 224 states and 348 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:26:43,188 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:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:44,078 INFO L93 Difference]: Finished difference Result 463 states and 728 transitions. [2022-04-27 15:26:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:44,078 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:26:44,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:44,078 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:26:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-27 15:26:44,081 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:26:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-27 15:26:44,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-04-27 15:26:44,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:44,355 INFO L225 Difference]: With dead ends: 463 [2022-04-27 15:26:44,355 INFO L226 Difference]: Without dead ends: 265 [2022-04-27 15:26:44,355 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:44,356 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 32 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 477 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:44,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 477 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:44,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-04-27 15:26:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 246. [2022-04-27 15:26:44,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:44,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 265 states. Second operand has 246 states, 241 states have (on average 1.5767634854771784) internal successors, (380), 241 states have internal predecessors, (380), 3 states have call successors, (3), 3 states 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:44,372 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand has 246 states, 241 states have (on average 1.5767634854771784) internal successors, (380), 241 states have internal predecessors, (380), 3 states have call successors, (3), 3 states 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:44,373 INFO L87 Difference]: Start difference. First operand 265 states. Second operand has 246 states, 241 states have (on average 1.5767634854771784) internal successors, (380), 241 states have internal predecessors, (380), 3 states have call successors, (3), 3 states 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:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:44,378 INFO L93 Difference]: Finished difference Result 265 states and 409 transitions. [2022-04-27 15:26:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 409 transitions. [2022-04-27 15:26:44,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:44,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:44,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.5767634854771784) internal successors, (380), 241 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 265 states. [2022-04-27 15:26:44,379 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.5767634854771784) internal successors, (380), 241 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 265 states. [2022-04-27 15:26:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:44,382 INFO L93 Difference]: Finished difference Result 265 states and 409 transitions. [2022-04-27 15:26:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 409 transitions. [2022-04-27 15:26:44,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:44,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:44,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:44,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5767634854771784) internal successors, (380), 241 states have internal predecessors, (380), 3 states have call successors, (3), 3 states 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:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 384 transitions. [2022-04-27 15:26:44,386 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 384 transitions. Word has length 70 [2022-04-27 15:26:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:44,386 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 384 transitions. [2022-04-27 15:26:44,386 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:26:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 384 transitions. [2022-04-27 15:26:44,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:26:44,387 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:44,387 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:44,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:26:44,387 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:44,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1454749477, now seen corresponding path program 1 times [2022-04-27 15:26:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:44,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013633169] [2022-04-27 15:26:44,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:44,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:44,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {12262#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {12255#true} is VALID [2022-04-27 15:26:44,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {12255#true} assume true; {12255#true} is VALID [2022-04-27 15:26:44,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12255#true} {12255#true} #661#return; {12255#true} is VALID [2022-04-27 15:26:44,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {12255#true} call ULTIMATE.init(); {12262#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:44,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {12262#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {12255#true} is VALID [2022-04-27 15:26:44,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {12255#true} assume true; {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12255#true} {12255#true} #661#return; {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {12255#true} call #t~ret161 := main(); {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {12255#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; {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {12255#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L272 TraceCheckUtils]: 7: Hoare triple {12255#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {12255#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {12255#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {12255#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {12255#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {12255#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {12255#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {12255#true} assume !false; {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {12255#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {12255#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {12255#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {12255#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {12255#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {12255#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {12255#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {12255#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {12255#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {12255#true} assume 8464 == #t~mem55;havoc #t~mem55; {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {12255#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {12255#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {12255#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); {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {12255#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {12255#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {12255#true} ~skip~0 := 0; {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {12255#true} assume !false; {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {12255#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {12255#true} assume 12292 == #t~mem47;havoc #t~mem47; {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {12255#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 35: Hoare triple {12255#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {12255#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 37: Hoare triple {12255#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 38: Hoare triple {12255#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {12255#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {12255#true} is VALID [2022-04-27 15:26:44,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {12255#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {12255#true} is VALID [2022-04-27 15:26:44,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {12255#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:44,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:44,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:44,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:44,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:44,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:44,499 INFO L290 TraceCheckUtils]: 47: Hoare triple {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:44,499 INFO L290 TraceCheckUtils]: 48: Hoare triple {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:44,500 INFO L290 TraceCheckUtils]: 49: Hoare triple {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:44,500 INFO L290 TraceCheckUtils]: 50: Hoare triple {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:44,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {12260#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12261#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-27 15:26:44,500 INFO L290 TraceCheckUtils]: 52: Hoare triple {12261#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,500 INFO L290 TraceCheckUtils]: 53: Hoare triple {12256#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,500 INFO L290 TraceCheckUtils]: 54: Hoare triple {12256#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,500 INFO L290 TraceCheckUtils]: 55: Hoare triple {12256#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {12256#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {12256#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 58: Hoare triple {12256#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 59: Hoare triple {12256#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 60: Hoare triple {12256#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 61: Hoare triple {12256#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 62: Hoare triple {12256#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 63: Hoare triple {12256#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 64: Hoare triple {12256#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 65: Hoare triple {12256#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 66: Hoare triple {12256#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 67: Hoare triple {12256#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 68: Hoare triple {12256#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 69: Hoare triple {12256#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 70: Hoare triple {12256#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 71: Hoare triple {12256#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 72: Hoare triple {12256#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 73: Hoare triple {12256#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 74: Hoare triple {12256#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 75: Hoare triple {12256#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,501 INFO L290 TraceCheckUtils]: 76: Hoare triple {12256#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,502 INFO L290 TraceCheckUtils]: 77: Hoare triple {12256#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,502 INFO L290 TraceCheckUtils]: 78: Hoare triple {12256#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,502 INFO L290 TraceCheckUtils]: 79: Hoare triple {12256#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {12256#false} is VALID [2022-04-27 15:26:44,502 INFO L290 TraceCheckUtils]: 80: Hoare triple {12256#false} assume 8673 == #t~mem80;havoc #t~mem80; {12256#false} is VALID [2022-04-27 15:26:44,502 INFO L290 TraceCheckUtils]: 81: Hoare triple {12256#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {12256#false} is VALID [2022-04-27 15:26:44,502 INFO L290 TraceCheckUtils]: 82: Hoare triple {12256#false} assume 4 == ~blastFlag~0; {12256#false} is VALID [2022-04-27 15:26:44,502 INFO L290 TraceCheckUtils]: 83: Hoare triple {12256#false} assume !false; {12256#false} is VALID [2022-04-27 15:26:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:26:44,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:44,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013633169] [2022-04-27 15:26:44,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013633169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:44,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:44,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455508593] [2022-04-27 15:26:44,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:44,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 15:26:44,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:44,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:44,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:44,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:44,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:44,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:44,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:44,554 INFO L87 Difference]: Start difference. First operand 246 states and 384 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:46,573 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:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:47,553 INFO L93 Difference]: Finished difference Result 479 states and 754 transitions. [2022-04-27 15:26:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:47,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 15:26:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-27 15:26:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-27 15:26:47,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-27 15:26:47,815 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:47,818 INFO L225 Difference]: With dead ends: 479 [2022-04-27 15:26:47,818 INFO L226 Difference]: Without dead ends: 259 [2022-04-27 15:26:47,819 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:47,819 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 22 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:47,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 544 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:26:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-27 15:26:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 246. [2022-04-27 15:26:47,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:47,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 241 states have internal predecessors, (379), 3 states have call successors, (3), 3 states 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:47,824 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 241 states have internal predecessors, (379), 3 states have call successors, (3), 3 states 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:47,824 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 241 states have internal predecessors, (379), 3 states have call successors, (3), 3 states 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:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:47,827 INFO L93 Difference]: Finished difference Result 259 states and 399 transitions. [2022-04-27 15:26:47,827 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 399 transitions. [2022-04-27 15:26:47,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:47,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:47,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 241 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-27 15:26:47,828 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 241 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-27 15:26:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:47,831 INFO L93 Difference]: Finished difference Result 259 states and 399 transitions. [2022-04-27 15:26:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 399 transitions. [2022-04-27 15:26:47,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:47,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:47,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:47,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 241 states have internal predecessors, (379), 3 states have call successors, (3), 3 states 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:47,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 383 transitions. [2022-04-27 15:26:47,835 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 383 transitions. Word has length 84 [2022-04-27 15:26:47,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:47,836 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 383 transitions. [2022-04-27 15:26:47,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:47,836 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 383 transitions. [2022-04-27 15:26:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:26:47,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:47,836 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:47,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:26:47,836 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:47,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:47,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1280749327, now seen corresponding path program 1 times [2022-04-27 15:26:47,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:47,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465552281] [2022-04-27 15:26:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:47,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:47,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:47,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {13627#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {13620#true} is VALID [2022-04-27 15:26:47,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {13620#true} assume true; {13620#true} is VALID [2022-04-27 15:26:47,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13620#true} {13620#true} #661#return; {13620#true} is VALID [2022-04-27 15:26:47,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {13620#true} call ULTIMATE.init(); {13627#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:47,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {13627#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {13620#true} is VALID [2022-04-27 15:26:47,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {13620#true} assume true; {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13620#true} {13620#true} #661#return; {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {13620#true} call #t~ret161 := main(); {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {13620#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; {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {13620#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L272 TraceCheckUtils]: 7: Hoare triple {13620#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {13620#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {13620#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {13620#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {13620#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {13620#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {13620#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {13620#true} assume !false; {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {13620#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {13620#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {13620#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {13620#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {13620#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {13620#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {13620#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13620#true} is VALID [2022-04-27 15:26:47,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {13620#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13620#true} is VALID [2022-04-27 15:26:47,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {13620#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13620#true} is VALID [2022-04-27 15:26:47,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {13620#true} assume 8464 == #t~mem55;havoc #t~mem55; {13620#true} is VALID [2022-04-27 15:26:47,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {13620#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {13620#true} is VALID [2022-04-27 15:26:47,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {13620#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13620#true} is VALID [2022-04-27 15:26:47,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {13620#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); {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:47,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:47,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:47,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:47,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:47,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:47,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:47,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:47,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:47,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:47,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:47,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:47,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {13625#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13626#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-27 15:26:47,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {13626#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {13621#false} is VALID [2022-04-27 15:26:47,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {13621#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,950 INFO L290 TraceCheckUtils]: 42: Hoare triple {13621#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {13621#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13621#false} is VALID [2022-04-27 15:26:47,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {13621#false} ~skip~0 := 0; {13621#false} is VALID [2022-04-27 15:26:47,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {13621#false} assume !false; {13621#false} is VALID [2022-04-27 15:26:47,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {13621#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {13621#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {13621#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {13621#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {13621#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 51: Hoare triple {13621#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 52: Hoare triple {13621#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {13621#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {13621#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {13621#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {13621#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {13621#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {13621#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {13621#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 60: Hoare triple {13621#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 61: Hoare triple {13621#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 62: Hoare triple {13621#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 63: Hoare triple {13621#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 64: Hoare triple {13621#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 65: Hoare triple {13621#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 66: Hoare triple {13621#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 67: Hoare triple {13621#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 68: Hoare triple {13621#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,951 INFO L290 TraceCheckUtils]: 69: Hoare triple {13621#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L290 TraceCheckUtils]: 70: Hoare triple {13621#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L290 TraceCheckUtils]: 71: Hoare triple {13621#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L290 TraceCheckUtils]: 72: Hoare triple {13621#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L290 TraceCheckUtils]: 73: Hoare triple {13621#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L290 TraceCheckUtils]: 74: Hoare triple {13621#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L290 TraceCheckUtils]: 75: Hoare triple {13621#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L290 TraceCheckUtils]: 76: Hoare triple {13621#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L290 TraceCheckUtils]: 77: Hoare triple {13621#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L290 TraceCheckUtils]: 78: Hoare triple {13621#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L290 TraceCheckUtils]: 79: Hoare triple {13621#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L290 TraceCheckUtils]: 80: Hoare triple {13621#false} assume 8673 == #t~mem80;havoc #t~mem80; {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L290 TraceCheckUtils]: 81: Hoare triple {13621#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L290 TraceCheckUtils]: 82: Hoare triple {13621#false} assume 4 == ~blastFlag~0; {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L290 TraceCheckUtils]: 83: Hoare triple {13621#false} assume !false; {13621#false} is VALID [2022-04-27 15:26:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:26:47,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:47,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465552281] [2022-04-27 15:26:47,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465552281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:47,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:47,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:47,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374344967] [2022-04-27 15:26:47,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:47,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 15:26:47,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:47,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:48,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:48,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:48,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:48,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:48,006 INFO L87 Difference]: Start difference. First operand 246 states and 383 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:50,025 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:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:51,102 INFO L93 Difference]: Finished difference Result 561 states and 880 transitions. [2022-04-27 15:26:51,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:51,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 15:26:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2022-04-27 15:26:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2022-04-27 15:26:51,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 563 transitions. [2022-04-27 15:26:51,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 563 edges. 563 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:51,471 INFO L225 Difference]: With dead ends: 561 [2022-04-27 15:26:51,471 INFO L226 Difference]: Without dead ends: 341 [2022-04-27 15:26:51,472 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:51,472 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 133 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:51,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:26:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-04-27 15:26:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 247. [2022-04-27 15:26:51,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:51,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 341 states. Second operand has 247 states, 242 states have (on average 1.56198347107438) internal successors, (378), 242 states have internal predecessors, (378), 3 states have call successors, (3), 3 states 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:51,476 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand has 247 states, 242 states have (on average 1.56198347107438) internal successors, (378), 242 states have internal predecessors, (378), 3 states have call successors, (3), 3 states 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:51,477 INFO L87 Difference]: Start difference. First operand 341 states. Second operand has 247 states, 242 states have (on average 1.56198347107438) internal successors, (378), 242 states have internal predecessors, (378), 3 states have call successors, (3), 3 states 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:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:51,481 INFO L93 Difference]: Finished difference Result 341 states and 524 transitions. [2022-04-27 15:26:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 524 transitions. [2022-04-27 15:26:51,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:51,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:51,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 242 states have (on average 1.56198347107438) internal successors, (378), 242 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 341 states. [2022-04-27 15:26:51,482 INFO L87 Difference]: Start difference. First operand has 247 states, 242 states have (on average 1.56198347107438) internal successors, (378), 242 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 341 states. [2022-04-27 15:26:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:51,487 INFO L93 Difference]: Finished difference Result 341 states and 524 transitions. [2022-04-27 15:26:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 524 transitions. [2022-04-27 15:26:51,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:51,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:51,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:51,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.56198347107438) internal successors, (378), 242 states have internal predecessors, (378), 3 states have call successors, (3), 3 states 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:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 382 transitions. [2022-04-27 15:26:51,491 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 382 transitions. Word has length 84 [2022-04-27 15:26:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:51,491 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 382 transitions. [2022-04-27 15:26:51,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 382 transitions. [2022-04-27 15:26:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 15:26:51,492 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:51,492 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:51,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:26:51,492 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1669457340, now seen corresponding path program 1 times [2022-04-27 15:26:51,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:51,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256672501] [2022-04-27 15:26:51,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:51,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:51,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:51,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {15257#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {15249#true} is VALID [2022-04-27 15:26:51,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {15249#true} assume true; {15249#true} is VALID [2022-04-27 15:26:51,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15249#true} {15249#true} #661#return; {15249#true} is VALID [2022-04-27 15:26:51,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {15249#true} call ULTIMATE.init(); {15257#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:51,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {15257#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {15249#true} is VALID [2022-04-27 15:26:51,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {15249#true} assume true; {15249#true} is VALID [2022-04-27 15:26:51,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15249#true} {15249#true} #661#return; {15249#true} is VALID [2022-04-27 15:26:51,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {15249#true} call #t~ret161 := main(); {15249#true} is VALID [2022-04-27 15:26:51,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {15249#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; {15249#true} is VALID [2022-04-27 15:26:51,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {15249#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {15249#true} is VALID [2022-04-27 15:26:51,613 INFO L272 TraceCheckUtils]: 7: Hoare triple {15249#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {15249#true} is VALID [2022-04-27 15:26:51,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {15249#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {15249#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {15249#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {15249#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {15249#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {15249#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {15249#true} assume !false; {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {15249#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {15249#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {15249#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {15249#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {15249#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {15249#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {15249#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {15249#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {15249#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {15249#true} assume 8464 == #t~mem55;havoc #t~mem55; {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {15249#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {15249#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {15249#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); {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {15249#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {15249#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {15249#true} is VALID [2022-04-27 15:26:51,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {15249#true} ~skip~0 := 0; {15249#true} is VALID [2022-04-27 15:26:51,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {15249#true} assume !false; {15249#true} is VALID [2022-04-27 15:26:51,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {15249#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15254#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:51,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {15254#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {15255#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:51,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {15255#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {15255#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:51,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {15255#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {15255#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:51,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {15255#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15255#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:51,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {15255#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {15255#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:51,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {15255#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {15255#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:51,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {15255#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {15255#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {15255#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {15256#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {15256#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {15250#false} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {15250#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {15250#false} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 43: Hoare triple {15250#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {15250#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {15250#false} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 45: Hoare triple {15250#false} ~skip~0 := 0; {15250#false} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 46: Hoare triple {15250#false} assume !false; {15250#false} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 47: Hoare triple {15250#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 48: Hoare triple {15250#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 49: Hoare triple {15250#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 50: Hoare triple {15250#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {15250#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {15250#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {15250#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 54: Hoare triple {15250#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,619 INFO L290 TraceCheckUtils]: 55: Hoare triple {15250#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {15250#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 57: Hoare triple {15250#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 58: Hoare triple {15250#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 59: Hoare triple {15250#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 60: Hoare triple {15250#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 61: Hoare triple {15250#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {15250#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 63: Hoare triple {15250#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {15250#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 65: Hoare triple {15250#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 66: Hoare triple {15250#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 67: Hoare triple {15250#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 68: Hoare triple {15250#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 69: Hoare triple {15250#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 70: Hoare triple {15250#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 71: Hoare triple {15250#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 72: Hoare triple {15250#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 73: Hoare triple {15250#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 74: Hoare triple {15250#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 75: Hoare triple {15250#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,620 INFO L290 TraceCheckUtils]: 76: Hoare triple {15250#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,621 INFO L290 TraceCheckUtils]: 77: Hoare triple {15250#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,621 INFO L290 TraceCheckUtils]: 78: Hoare triple {15250#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,621 INFO L290 TraceCheckUtils]: 79: Hoare triple {15250#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,621 INFO L290 TraceCheckUtils]: 80: Hoare triple {15250#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {15250#false} is VALID [2022-04-27 15:26:51,621 INFO L290 TraceCheckUtils]: 81: Hoare triple {15250#false} assume 8673 == #t~mem80;havoc #t~mem80; {15250#false} is VALID [2022-04-27 15:26:51,621 INFO L290 TraceCheckUtils]: 82: Hoare triple {15250#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {15250#false} is VALID [2022-04-27 15:26:51,621 INFO L290 TraceCheckUtils]: 83: Hoare triple {15250#false} assume 4 == ~blastFlag~0; {15250#false} is VALID [2022-04-27 15:26:51,621 INFO L290 TraceCheckUtils]: 84: Hoare triple {15250#false} assume !false; {15250#false} is VALID [2022-04-27 15:26:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 15:26:51,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:51,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256672501] [2022-04-27 15:26:51,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256672501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:51,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:51,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 15:26:51,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874758288] [2022-04-27 15:26:51,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:51,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-27 15:26:51,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:51,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:51,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:51,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 15:26:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:51,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 15:26:51,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:51,674 INFO L87 Difference]: Start difference. First operand 247 states and 382 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:53,697 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:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:54,712 INFO L93 Difference]: Finished difference Result 477 states and 746 transitions. [2022-04-27 15:26:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 15:26:54,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-27 15:26:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-04-27 15:26:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-04-27 15:26:54,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 403 transitions. [2022-04-27 15:26:54,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:54,973 INFO L225 Difference]: With dead ends: 477 [2022-04-27 15:26:54,973 INFO L226 Difference]: Without dead ends: 256 [2022-04-27 15:26:54,974 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:54,974 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 3 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:54,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 593 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:26:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-27 15:26:54,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-04-27 15:26:54,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:54,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 256 states, 251 states have (on average 1.549800796812749) internal successors, (389), 251 states have internal predecessors, (389), 3 states have call successors, (3), 3 states 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:54,978 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 256 states, 251 states have (on average 1.549800796812749) internal successors, (389), 251 states have internal predecessors, (389), 3 states have call successors, (3), 3 states 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:54,978 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 256 states, 251 states have (on average 1.549800796812749) internal successors, (389), 251 states have internal predecessors, (389), 3 states have call successors, (3), 3 states 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:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:54,982 INFO L93 Difference]: Finished difference Result 256 states and 393 transitions. [2022-04-27 15:26:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 393 transitions. [2022-04-27 15:26:54,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:54,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:54,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 251 states have (on average 1.549800796812749) internal successors, (389), 251 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 256 states. [2022-04-27 15:26:54,983 INFO L87 Difference]: Start difference. First operand has 256 states, 251 states have (on average 1.549800796812749) internal successors, (389), 251 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 256 states. [2022-04-27 15:26:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:54,986 INFO L93 Difference]: Finished difference Result 256 states and 393 transitions. [2022-04-27 15:26:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 393 transitions. [2022-04-27 15:26:54,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:54,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:54,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:54,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 251 states have (on average 1.549800796812749) internal successors, (389), 251 states have internal predecessors, (389), 3 states have call successors, (3), 3 states 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:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 393 transitions. [2022-04-27 15:26:54,990 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 393 transitions. Word has length 85 [2022-04-27 15:26:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:54,991 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 393 transitions. [2022-04-27 15:26:54,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:54,991 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 393 transitions. [2022-04-27 15:26:54,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 15:26:54,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:54,991 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:54,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:26:54,992 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:54,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:54,993 INFO L85 PathProgramCache]: Analyzing trace with hash 500010200, now seen corresponding path program 1 times [2022-04-27 15:26:54,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:54,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566786456] [2022-04-27 15:26:54,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:55,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:55,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {16623#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {16616#true} is VALID [2022-04-27 15:26:55,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-27 15:26:55,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16616#true} {16616#true} #661#return; {16616#true} is VALID [2022-04-27 15:26:55,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {16616#true} call ULTIMATE.init(); {16623#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:55,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {16623#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {16616#true} is VALID [2022-04-27 15:26:55,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-27 15:26:55,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16616#true} {16616#true} #661#return; {16616#true} is VALID [2022-04-27 15:26:55,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {16616#true} call #t~ret161 := main(); {16616#true} is VALID [2022-04-27 15:26:55,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {16616#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; {16616#true} is VALID [2022-04-27 15:26:55,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {16616#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16616#true} is VALID [2022-04-27 15:26:55,092 INFO L272 TraceCheckUtils]: 7: Hoare triple {16616#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16616#true} is VALID [2022-04-27 15:26:55,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {16616#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {16616#true} is VALID [2022-04-27 15:26:55,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {16616#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16616#true} is VALID [2022-04-27 15:26:55,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {16616#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {16616#true} is VALID [2022-04-27 15:26:55,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {16616#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16616#true} is VALID [2022-04-27 15:26:55,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {16616#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16616#true} is VALID [2022-04-27 15:26:55,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {16616#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {16616#true} is VALID [2022-04-27 15:26:55,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {16616#true} assume !false; {16616#true} is VALID [2022-04-27 15:26:55,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {16616#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16616#true} is VALID [2022-04-27 15:26:55,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {16616#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16616#true} is VALID [2022-04-27 15:26:55,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {16616#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16616#true} is VALID [2022-04-27 15:26:55,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {16616#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16616#true} is VALID [2022-04-27 15:26:55,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {16616#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16616#true} is VALID [2022-04-27 15:26:55,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {16616#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16616#true} is VALID [2022-04-27 15:26:55,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {16616#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16616#true} is VALID [2022-04-27 15:26:55,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {16616#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16616#true} is VALID [2022-04-27 15:26:55,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {16616#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16616#true} is VALID [2022-04-27 15:26:55,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {16616#true} assume 8464 == #t~mem55;havoc #t~mem55; {16616#true} is VALID [2022-04-27 15:26:55,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {16616#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {16616#true} is VALID [2022-04-27 15:26:55,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {16616#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16616#true} is VALID [2022-04-27 15:26:55,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {16616#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); {16621#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {16621#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16621#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {16621#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16621#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {16621#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {16621#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {16621#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16621#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {16621#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16621#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,096 INFO L290 TraceCheckUtils]: 33: Hoare triple {16621#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16622#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-27 15:26:55,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {16622#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {16617#false} is VALID [2022-04-27 15:26:55,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {16617#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {16617#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16617#false} is VALID [2022-04-27 15:26:55,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {16617#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {16617#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {16617#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {16617#false} is VALID [2022-04-27 15:26:55,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {16617#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {16617#false} assume 12292 != #t~mem85;havoc #t~mem85; {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {16617#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {16617#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {16617#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {16617#false} ~skip~0 := 0; {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {16617#false} assume !false; {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {16617#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {16617#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {16617#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 50: Hoare triple {16617#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 51: Hoare triple {16617#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 52: Hoare triple {16617#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 53: Hoare triple {16617#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 54: Hoare triple {16617#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 55: Hoare triple {16617#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 56: Hoare triple {16617#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 57: Hoare triple {16617#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 58: Hoare triple {16617#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 59: Hoare triple {16617#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 60: Hoare triple {16617#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 61: Hoare triple {16617#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 62: Hoare triple {16617#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,097 INFO L290 TraceCheckUtils]: 63: Hoare triple {16617#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 64: Hoare triple {16617#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 65: Hoare triple {16617#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 66: Hoare triple {16617#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 67: Hoare triple {16617#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 68: Hoare triple {16617#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 69: Hoare triple {16617#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {16617#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 71: Hoare triple {16617#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 72: Hoare triple {16617#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 73: Hoare triple {16617#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 74: Hoare triple {16617#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 75: Hoare triple {16617#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 76: Hoare triple {16617#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 77: Hoare triple {16617#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 78: Hoare triple {16617#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 79: Hoare triple {16617#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 80: Hoare triple {16617#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 81: Hoare triple {16617#false} assume 8673 == #t~mem80;havoc #t~mem80; {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 82: Hoare triple {16617#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 83: Hoare triple {16617#false} assume 4 == ~blastFlag~0; {16617#false} is VALID [2022-04-27 15:26:55,098 INFO L290 TraceCheckUtils]: 84: Hoare triple {16617#false} assume !false; {16617#false} is VALID [2022-04-27 15:26:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:26:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:55,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566786456] [2022-04-27 15:26:55,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566786456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:55,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:55,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:55,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064083488] [2022-04-27 15:26:55,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:55,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-27 15:26:55,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:55,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:55,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:55,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:55,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:55,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:55,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:55,162 INFO L87 Difference]: Start difference. First operand 256 states and 393 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:57,183 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:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:58,288 INFO L93 Difference]: Finished difference Result 589 states and 909 transitions. [2022-04-27 15:26:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:58,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-27 15:26:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-27 15:26:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-27 15:26:58,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 562 transitions. [2022-04-27 15:26:58,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 562 edges. 562 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:58,660 INFO L225 Difference]: With dead ends: 589 [2022-04-27 15:26:58,660 INFO L226 Difference]: Without dead ends: 359 [2022-04-27 15:26:58,660 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:58,662 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 138 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:58,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:26:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-27 15:26:58,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 256. [2022-04-27 15:26:58,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:58,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 256 states, 251 states have (on average 1.5338645418326693) internal successors, (385), 251 states have internal predecessors, (385), 3 states have call successors, (3), 3 states 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:58,672 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 256 states, 251 states have (on average 1.5338645418326693) internal successors, (385), 251 states have internal predecessors, (385), 3 states have call successors, (3), 3 states 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:58,673 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 256 states, 251 states have (on average 1.5338645418326693) internal successors, (385), 251 states have internal predecessors, (385), 3 states have call successors, (3), 3 states 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:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:58,678 INFO L93 Difference]: Finished difference Result 359 states and 542 transitions. [2022-04-27 15:26:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 542 transitions. [2022-04-27 15:26:58,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:58,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:58,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 251 states have (on average 1.5338645418326693) internal successors, (385), 251 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 359 states. [2022-04-27 15:26:58,679 INFO L87 Difference]: Start difference. First operand has 256 states, 251 states have (on average 1.5338645418326693) internal successors, (385), 251 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 359 states. [2022-04-27 15:26:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:58,685 INFO L93 Difference]: Finished difference Result 359 states and 542 transitions. [2022-04-27 15:26:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 542 transitions. [2022-04-27 15:26:58,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:58,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:58,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:58,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 251 states have (on average 1.5338645418326693) internal successors, (385), 251 states have internal predecessors, (385), 3 states have call successors, (3), 3 states 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:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2022-04-27 15:26:58,689 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 85 [2022-04-27 15:26:58,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:58,689 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2022-04-27 15:26:58,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2022-04-27 15:26:58,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-27 15:26:58,690 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:58,690 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:58,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:26:58,690 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:58,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:58,691 INFO L85 PathProgramCache]: Analyzing trace with hash -989381741, now seen corresponding path program 1 times [2022-04-27 15:26:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:58,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697289829] [2022-04-27 15:26:58,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:58,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:58,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:58,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {18329#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {18322#true} is VALID [2022-04-27 15:26:58,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {18322#true} assume true; {18322#true} is VALID [2022-04-27 15:26:58,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18322#true} {18322#true} #661#return; {18322#true} is VALID [2022-04-27 15:26:58,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {18322#true} call ULTIMATE.init(); {18329#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:58,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {18329#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {18322#true} is VALID [2022-04-27 15:26:58,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {18322#true} assume true; {18322#true} is VALID [2022-04-27 15:26:58,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18322#true} {18322#true} #661#return; {18322#true} is VALID [2022-04-27 15:26:58,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {18322#true} call #t~ret161 := main(); {18322#true} is VALID [2022-04-27 15:26:58,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {18322#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; {18322#true} is VALID [2022-04-27 15:26:58,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {18322#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L272 TraceCheckUtils]: 7: Hoare triple {18322#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {18322#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {18322#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {18322#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {18322#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {18322#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {18322#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {18322#true} assume !false; {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {18322#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {18322#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {18322#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {18322#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {18322#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {18322#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {18322#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {18322#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {18322#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {18322#true} assume 8464 == #t~mem55;havoc #t~mem55; {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {18322#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {18322#true} is VALID [2022-04-27 15:26:58,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {18322#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18322#true} is VALID [2022-04-27 15:26:58,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {18322#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); {18327#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:58,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {18327#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {18327#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:58,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {18327#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18327#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:58,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {18327#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {18327#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:58,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {18327#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {18327#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:58,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {18327#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18327#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:58,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {18327#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18327#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {18327#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18328#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {18328#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {18323#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {18323#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {18323#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 39: Hoare triple {18323#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {18323#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {18323#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {18323#false} assume 12292 != #t~mem85;havoc #t~mem85; {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {18323#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {18323#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {18323#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {18323#false} ~skip~0 := 0; {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 47: Hoare triple {18323#false} assume !false; {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {18323#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 49: Hoare triple {18323#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {18323#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {18323#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {18323#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {18323#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {18323#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 55: Hoare triple {18323#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 56: Hoare triple {18323#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 57: Hoare triple {18323#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {18323#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 59: Hoare triple {18323#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 60: Hoare triple {18323#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {18323#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {18323#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 63: Hoare triple {18323#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 64: Hoare triple {18323#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 65: Hoare triple {18323#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 66: Hoare triple {18323#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 67: Hoare triple {18323#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 68: Hoare triple {18323#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 69: Hoare triple {18323#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 70: Hoare triple {18323#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 71: Hoare triple {18323#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,804 INFO L290 TraceCheckUtils]: 72: Hoare triple {18323#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,805 INFO L290 TraceCheckUtils]: 73: Hoare triple {18323#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,805 INFO L290 TraceCheckUtils]: 74: Hoare triple {18323#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,805 INFO L290 TraceCheckUtils]: 75: Hoare triple {18323#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,805 INFO L290 TraceCheckUtils]: 76: Hoare triple {18323#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,805 INFO L290 TraceCheckUtils]: 77: Hoare triple {18323#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,805 INFO L290 TraceCheckUtils]: 78: Hoare triple {18323#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,805 INFO L290 TraceCheckUtils]: 79: Hoare triple {18323#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,805 INFO L290 TraceCheckUtils]: 80: Hoare triple {18323#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,805 INFO L290 TraceCheckUtils]: 81: Hoare triple {18323#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {18323#false} is VALID [2022-04-27 15:26:58,805 INFO L290 TraceCheckUtils]: 82: Hoare triple {18323#false} assume 8673 == #t~mem80;havoc #t~mem80; {18323#false} is VALID [2022-04-27 15:26:58,805 INFO L290 TraceCheckUtils]: 83: Hoare triple {18323#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {18323#false} is VALID [2022-04-27 15:26:58,805 INFO L290 TraceCheckUtils]: 84: Hoare triple {18323#false} assume 4 == ~blastFlag~0; {18323#false} is VALID [2022-04-27 15:26:58,805 INFO L290 TraceCheckUtils]: 85: Hoare triple {18323#false} assume !false; {18323#false} is VALID [2022-04-27 15:26:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:26:58,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:58,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697289829] [2022-04-27 15:26:58,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697289829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:58,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:58,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:58,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364607578] [2022-04-27 15:26:58,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:58,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-27 15:26:58,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:58,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:58,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:58,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:58,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:58,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:58,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:58,867 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:00,887 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:27:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:01,980 INFO L93 Difference]: Finished difference Result 589 states and 901 transitions. [2022-04-27 15:27:01,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:01,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-27 15:27:01,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:01,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 561 transitions. [2022-04-27 15:27:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 561 transitions. [2022-04-27 15:27:01,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 561 transitions. [2022-04-27 15:27:02,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 561 edges. 561 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:02,339 INFO L225 Difference]: With dead ends: 589 [2022-04-27 15:27:02,339 INFO L226 Difference]: Without dead ends: 359 [2022-04-27 15:27:02,340 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:27:02,340 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 136 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:02,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:27:02,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-27 15:27:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 256. [2022-04-27 15:27:02,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:02,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 256 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 251 states have internal predecessors, (381), 3 states have call successors, (3), 3 states 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:02,345 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 256 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 251 states have internal predecessors, (381), 3 states have call successors, (3), 3 states 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:02,345 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 256 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 251 states have internal predecessors, (381), 3 states have call successors, (3), 3 states 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:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:02,350 INFO L93 Difference]: Finished difference Result 359 states and 538 transitions. [2022-04-27 15:27:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 538 transitions. [2022-04-27 15:27:02,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:02,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:02,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 251 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 359 states. [2022-04-27 15:27:02,351 INFO L87 Difference]: Start difference. First operand has 256 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 251 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 359 states. [2022-04-27 15:27:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:02,356 INFO L93 Difference]: Finished difference Result 359 states and 538 transitions. [2022-04-27 15:27:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 538 transitions. [2022-04-27 15:27:02,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:02,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:02,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:02,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 251 states have internal predecessors, (381), 3 states have call successors, (3), 3 states 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:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2022-04-27 15:27:02,360 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 86 [2022-04-27 15:27:02,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:02,360 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2022-04-27 15:27:02,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2022-04-27 15:27:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-27 15:27:02,361 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:02,361 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:02,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:27:02,362 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:02,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:02,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1455094013, now seen corresponding path program 1 times [2022-04-27 15:27:02,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:02,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453984782] [2022-04-27 15:27:02,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:02,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:02,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:02,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {20035#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {20028#true} is VALID [2022-04-27 15:27:02,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {20028#true} assume true; {20028#true} is VALID [2022-04-27 15:27:02,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20028#true} {20028#true} #661#return; {20028#true} is VALID [2022-04-27 15:27:02,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {20028#true} call ULTIMATE.init(); {20035#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:27:02,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {20035#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {20028#true} is VALID [2022-04-27 15:27:02,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {20028#true} assume true; {20028#true} is VALID [2022-04-27 15:27:02,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20028#true} {20028#true} #661#return; {20028#true} is VALID [2022-04-27 15:27:02,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {20028#true} call #t~ret161 := main(); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {20028#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; {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {20028#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L272 TraceCheckUtils]: 7: Hoare triple {20028#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {20028#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {20028#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {20028#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {20028#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {20028#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {20028#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {20028#true} assume !false; {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {20028#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {20028#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {20028#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {20028#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {20028#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {20028#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {20028#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {20028#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {20028#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20028#true} is VALID [2022-04-27 15:27:02,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {20028#true} assume 8464 == #t~mem55;havoc #t~mem55; {20028#true} is VALID [2022-04-27 15:27:02,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {20028#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {20028#true} is VALID [2022-04-27 15:27:02,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {20028#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20028#true} is VALID [2022-04-27 15:27:02,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {20028#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); {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:02,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:02,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:02,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:02,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:02,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:02,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:02,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:02,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {20033#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20034#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-27 15:27:02,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {20034#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {20029#false} is VALID [2022-04-27 15:27:02,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {20029#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {20029#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20029#false} is VALID [2022-04-27 15:27:02,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {20029#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {20029#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {20029#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {20029#false} is VALID [2022-04-27 15:27:02,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {20029#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {20029#false} assume 12292 != #t~mem85;havoc #t~mem85; {20029#false} is VALID [2022-04-27 15:27:02,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {20029#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {20029#false} is VALID [2022-04-27 15:27:02,458 INFO L290 TraceCheckUtils]: 45: Hoare triple {20029#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 46: Hoare triple {20029#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {20029#false} ~skip~0 := 0; {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {20029#false} assume !false; {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {20029#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {20029#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 51: Hoare triple {20029#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 52: Hoare triple {20029#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 53: Hoare triple {20029#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 54: Hoare triple {20029#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 55: Hoare triple {20029#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 56: Hoare triple {20029#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 57: Hoare triple {20029#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 58: Hoare triple {20029#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 59: Hoare triple {20029#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 60: Hoare triple {20029#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 61: Hoare triple {20029#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 62: Hoare triple {20029#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 63: Hoare triple {20029#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 64: Hoare triple {20029#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 65: Hoare triple {20029#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,459 INFO L290 TraceCheckUtils]: 66: Hoare triple {20029#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 67: Hoare triple {20029#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 68: Hoare triple {20029#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 69: Hoare triple {20029#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {20029#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 71: Hoare triple {20029#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 72: Hoare triple {20029#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 73: Hoare triple {20029#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 74: Hoare triple {20029#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 75: Hoare triple {20029#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 76: Hoare triple {20029#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 77: Hoare triple {20029#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 78: Hoare triple {20029#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 79: Hoare triple {20029#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 80: Hoare triple {20029#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 81: Hoare triple {20029#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 82: Hoare triple {20029#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 83: Hoare triple {20029#false} assume 8673 == #t~mem80;havoc #t~mem80; {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 84: Hoare triple {20029#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 85: Hoare triple {20029#false} assume 4 == ~blastFlag~0; {20029#false} is VALID [2022-04-27 15:27:02,460 INFO L290 TraceCheckUtils]: 86: Hoare triple {20029#false} assume !false; {20029#false} is VALID [2022-04-27 15:27:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:27:02,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:02,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453984782] [2022-04-27 15:27:02,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453984782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:02,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:02,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:02,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039688106] [2022-04-27 15:27:02,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:02,462 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 87 [2022-04-27 15:27:02,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:02,462 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:27:02,514 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:27:02,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:02,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:02,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:02,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:02,515 INFO L87 Difference]: Start difference. First operand 256 states and 385 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:27:04,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:27:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:05,615 INFO L93 Difference]: Finished difference Result 589 states and 893 transitions. [2022-04-27 15:27:05,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:05,615 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 87 [2022-04-27 15:27:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:05,615 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:27:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2022-04-27 15:27:05,617 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:27:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2022-04-27 15:27:05,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 560 transitions. [2022-04-27 15:27:05,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 560 edges. 560 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:05,988 INFO L225 Difference]: With dead ends: 589 [2022-04-27 15:27:05,989 INFO L226 Difference]: Without dead ends: 359 [2022-04-27 15:27:05,989 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:27:05,990 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 134 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:05,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:27:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-27 15:27:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 256. [2022-04-27 15:27:06,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:06,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 256 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 3 states have call successors, (3), 3 states 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:06,009 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 256 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 3 states have call successors, (3), 3 states 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:06,009 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 256 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 3 states have call successors, (3), 3 states 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:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:06,024 INFO L93 Difference]: Finished difference Result 359 states and 534 transitions. [2022-04-27 15:27:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 534 transitions. [2022-04-27 15:27:06,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:06,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:06,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 359 states. [2022-04-27 15:27:06,025 INFO L87 Difference]: Start difference. First operand has 256 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 359 states. [2022-04-27 15:27:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:06,030 INFO L93 Difference]: Finished difference Result 359 states and 534 transitions. [2022-04-27 15:27:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 534 transitions. [2022-04-27 15:27:06,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:06,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:06,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:06,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 3 states have call successors, (3), 3 states 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:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2022-04-27 15:27:06,034 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 87 [2022-04-27 15:27:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:06,034 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2022-04-27 15:27:06,035 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:27:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2022-04-27 15:27:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-27 15:27:06,035 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:06,035 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:06,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:27:06,035 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:06,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1295416728, now seen corresponding path program 1 times [2022-04-27 15:27:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:06,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393147896] [2022-04-27 15:27:06,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:06,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:06,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:06,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {21741#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {21734#true} is VALID [2022-04-27 15:27:06,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {21734#true} assume true; {21734#true} is VALID [2022-04-27 15:27:06,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21734#true} {21734#true} #661#return; {21734#true} is VALID [2022-04-27 15:27:06,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {21734#true} call ULTIMATE.init(); {21741#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:27:06,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {21741#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {21734#true} is VALID [2022-04-27 15:27:06,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {21734#true} assume true; {21734#true} is VALID [2022-04-27 15:27:06,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21734#true} {21734#true} #661#return; {21734#true} is VALID [2022-04-27 15:27:06,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {21734#true} call #t~ret161 := main(); {21734#true} is VALID [2022-04-27 15:27:06,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {21734#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; {21734#true} is VALID [2022-04-27 15:27:06,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {21734#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {21734#true} is VALID [2022-04-27 15:27:06,172 INFO L272 TraceCheckUtils]: 7: Hoare triple {21734#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21734#true} is VALID [2022-04-27 15:27:06,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {21734#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21734#true} is VALID [2022-04-27 15:27:06,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {21734#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {21734#true} is VALID [2022-04-27 15:27:06,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {21734#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {21734#true} is VALID [2022-04-27 15:27:06,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {21734#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21734#true} is VALID [2022-04-27 15:27:06,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {21734#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {21734#true} is VALID [2022-04-27 15:27:06,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {21734#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {21734#true} is VALID [2022-04-27 15:27:06,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {21734#true} assume !false; {21734#true} is VALID [2022-04-27 15:27:06,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {21734#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21734#true} is VALID [2022-04-27 15:27:06,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {21734#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21734#true} is VALID [2022-04-27 15:27:06,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {21734#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21734#true} is VALID [2022-04-27 15:27:06,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {21734#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21734#true} is VALID [2022-04-27 15:27:06,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {21734#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21734#true} is VALID [2022-04-27 15:27:06,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {21734#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21734#true} is VALID [2022-04-27 15:27:06,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {21734#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21734#true} is VALID [2022-04-27 15:27:06,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {21734#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21734#true} is VALID [2022-04-27 15:27:06,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {21734#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21734#true} is VALID [2022-04-27 15:27:06,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {21734#true} assume 8464 == #t~mem55;havoc #t~mem55; {21734#true} is VALID [2022-04-27 15:27:06,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {21734#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21734#true} is VALID [2022-04-27 15:27:06,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {21734#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21734#true} is VALID [2022-04-27 15:27:06,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {21734#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); {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:06,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:06,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:06,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:06,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:06,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:06,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:06,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:06,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:06,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {21739#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21740#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-27 15:27:06,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {21740#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {21735#false} is VALID [2022-04-27 15:27:06,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {21735#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,177 INFO L290 TraceCheckUtils]: 39: Hoare triple {21735#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21735#false} is VALID [2022-04-27 15:27:06,177 INFO L290 TraceCheckUtils]: 40: Hoare triple {21735#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {21735#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {21735#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {21735#false} is VALID [2022-04-27 15:27:06,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {21735#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {21735#false} assume 12292 != #t~mem85;havoc #t~mem85; {21735#false} is VALID [2022-04-27 15:27:06,177 INFO L290 TraceCheckUtils]: 45: Hoare triple {21735#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {21735#false} is VALID [2022-04-27 15:27:06,177 INFO L290 TraceCheckUtils]: 46: Hoare triple {21735#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,177 INFO L290 TraceCheckUtils]: 47: Hoare triple {21735#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {21735#false} ~skip~0 := 0; {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {21735#false} assume !false; {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 50: Hoare triple {21735#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 51: Hoare triple {21735#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 52: Hoare triple {21735#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {21735#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {21735#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 55: Hoare triple {21735#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {21735#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {21735#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 58: Hoare triple {21735#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 59: Hoare triple {21735#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 60: Hoare triple {21735#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 61: Hoare triple {21735#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 62: Hoare triple {21735#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 63: Hoare triple {21735#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 64: Hoare triple {21735#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 65: Hoare triple {21735#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 66: Hoare triple {21735#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 67: Hoare triple {21735#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,178 INFO L290 TraceCheckUtils]: 68: Hoare triple {21735#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 69: Hoare triple {21735#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 70: Hoare triple {21735#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 71: Hoare triple {21735#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 72: Hoare triple {21735#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 73: Hoare triple {21735#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 74: Hoare triple {21735#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 75: Hoare triple {21735#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 76: Hoare triple {21735#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 77: Hoare triple {21735#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 78: Hoare triple {21735#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 79: Hoare triple {21735#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 80: Hoare triple {21735#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 81: Hoare triple {21735#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 82: Hoare triple {21735#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 83: Hoare triple {21735#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 84: Hoare triple {21735#false} assume 8673 == #t~mem80;havoc #t~mem80; {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 85: Hoare triple {21735#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 86: Hoare triple {21735#false} assume 4 == ~blastFlag~0; {21735#false} is VALID [2022-04-27 15:27:06,179 INFO L290 TraceCheckUtils]: 87: Hoare triple {21735#false} assume !false; {21735#false} is VALID [2022-04-27 15:27:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:27:06,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:06,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393147896] [2022-04-27 15:27:06,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393147896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:06,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:06,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:06,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893977307] [2022-04-27 15:27:06,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:06,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-27 15:27:06,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:06,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:06,250 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:27:06,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:06,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:06,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:06,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:06,251 INFO L87 Difference]: Start difference. First operand 256 states and 381 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:08,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:27:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:09,316 INFO L93 Difference]: Finished difference Result 579 states and 872 transitions. [2022-04-27 15:27:09,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:09,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-27 15:27:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:09,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2022-04-27 15:27:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2022-04-27 15:27:09,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 557 transitions. [2022-04-27 15:27:09,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 557 edges. 557 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:09,688 INFO L225 Difference]: With dead ends: 579 [2022-04-27 15:27:09,688 INFO L226 Difference]: Without dead ends: 349 [2022-04-27 15:27:09,688 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:27:09,689 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 131 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:09,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 318 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 460 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:27:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-04-27 15:27:09,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 256. [2022-04-27 15:27:09,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:09,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 349 states. Second operand has 256 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 3 states have call successors, (3), 3 states 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:09,693 INFO L74 IsIncluded]: Start isIncluded. First operand 349 states. Second operand has 256 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 3 states have call successors, (3), 3 states 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:09,694 INFO L87 Difference]: Start difference. First operand 349 states. Second operand has 256 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 3 states have call successors, (3), 3 states 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:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:09,698 INFO L93 Difference]: Finished difference Result 349 states and 517 transitions. [2022-04-27 15:27:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 517 transitions. [2022-04-27 15:27:09,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:09,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:09,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 349 states. [2022-04-27 15:27:09,699 INFO L87 Difference]: Start difference. First operand has 256 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 349 states. [2022-04-27 15:27:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:09,704 INFO L93 Difference]: Finished difference Result 349 states and 517 transitions. [2022-04-27 15:27:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 517 transitions. [2022-04-27 15:27:09,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:09,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:09,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:09,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 3 states have call successors, (3), 3 states 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:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 377 transitions. [2022-04-27 15:27:09,708 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 377 transitions. Word has length 88 [2022-04-27 15:27:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:09,708 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 377 transitions. [2022-04-27 15:27:09,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2022-04-27 15:27:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-27 15:27:09,709 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:09,709 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:09,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:27:09,709 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:09,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:09,709 INFO L85 PathProgramCache]: Analyzing trace with hash 16034624, now seen corresponding path program 1 times [2022-04-27 15:27:09,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:09,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245747619] [2022-04-27 15:27:09,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:09,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:09,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:09,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {23416#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {23409#true} is VALID [2022-04-27 15:27:09,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {23409#true} assume true; {23409#true} is VALID [2022-04-27 15:27:09,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23409#true} {23409#true} #661#return; {23409#true} is VALID [2022-04-27 15:27:09,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {23409#true} call ULTIMATE.init(); {23416#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:27:09,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {23416#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {23409#true} is VALID [2022-04-27 15:27:09,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {23409#true} assume true; {23409#true} is VALID [2022-04-27 15:27:09,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23409#true} {23409#true} #661#return; {23409#true} is VALID [2022-04-27 15:27:09,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {23409#true} call #t~ret161 := main(); {23409#true} is VALID [2022-04-27 15:27:09,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {23409#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; {23409#true} is VALID [2022-04-27 15:27:09,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {23409#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,821 INFO L272 TraceCheckUtils]: 7: Hoare triple {23409#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23409#true} is VALID [2022-04-27 15:27:09,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {23409#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {23409#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {23409#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {23409#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {23409#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {23409#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {23409#true} assume !false; {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {23409#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {23409#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {23409#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {23409#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {23409#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {23409#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {23409#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {23409#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {23409#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {23409#true} assume 8464 == #t~mem55;havoc #t~mem55; {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {23409#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {23409#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {23409#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); {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {23409#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {23409#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23409#true} is VALID [2022-04-27 15:27:09,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {23409#true} ~skip~0 := 0; {23409#true} is VALID [2022-04-27 15:27:09,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {23409#true} assume !false; {23409#true} is VALID [2022-04-27 15:27:09,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {23409#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {23409#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {23409#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {23409#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {23409#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {23409#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {23409#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {23409#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {23409#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {23409#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {23409#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,847 INFO L290 TraceCheckUtils]: 43: Hoare triple {23409#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {23409#true} assume 8496 == #t~mem58;havoc #t~mem58; {23409#true} is VALID [2022-04-27 15:27:09,848 INFO L290 TraceCheckUtils]: 45: Hoare triple {23409#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {23409#true} is VALID [2022-04-27 15:27:09,848 INFO L290 TraceCheckUtils]: 46: Hoare triple {23409#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {23409#true} is VALID [2022-04-27 15:27:09,848 INFO L290 TraceCheckUtils]: 47: Hoare triple {23409#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {23409#true} is VALID [2022-04-27 15:27:09,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {23409#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,850 INFO L290 TraceCheckUtils]: 51: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,850 INFO L290 TraceCheckUtils]: 53: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,851 INFO L290 TraceCheckUtils]: 55: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,851 INFO L290 TraceCheckUtils]: 56: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,852 INFO L290 TraceCheckUtils]: 57: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,853 INFO L290 TraceCheckUtils]: 60: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,853 INFO L290 TraceCheckUtils]: 61: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,853 INFO L290 TraceCheckUtils]: 63: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,854 INFO L290 TraceCheckUtils]: 64: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,854 INFO L290 TraceCheckUtils]: 65: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,854 INFO L290 TraceCheckUtils]: 66: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,854 INFO L290 TraceCheckUtils]: 67: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,855 INFO L290 TraceCheckUtils]: 68: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,855 INFO L290 TraceCheckUtils]: 69: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,855 INFO L290 TraceCheckUtils]: 70: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,856 INFO L290 TraceCheckUtils]: 71: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,856 INFO L290 TraceCheckUtils]: 72: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,856 INFO L290 TraceCheckUtils]: 73: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,856 INFO L290 TraceCheckUtils]: 74: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,857 INFO L290 TraceCheckUtils]: 75: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,857 INFO L290 TraceCheckUtils]: 76: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,857 INFO L290 TraceCheckUtils]: 77: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,858 INFO L290 TraceCheckUtils]: 78: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,858 INFO L290 TraceCheckUtils]: 79: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,858 INFO L290 TraceCheckUtils]: 80: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,858 INFO L290 TraceCheckUtils]: 81: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,859 INFO L290 TraceCheckUtils]: 82: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,859 INFO L290 TraceCheckUtils]: 83: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:09,859 INFO L290 TraceCheckUtils]: 84: Hoare triple {23414#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {23415#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-27 15:27:09,860 INFO L290 TraceCheckUtils]: 85: Hoare triple {23415#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {23410#false} is VALID [2022-04-27 15:27:09,860 INFO L290 TraceCheckUtils]: 86: Hoare triple {23410#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {23410#false} is VALID [2022-04-27 15:27:09,860 INFO L290 TraceCheckUtils]: 87: Hoare triple {23410#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {23410#false} is VALID [2022-04-27 15:27:09,860 INFO L290 TraceCheckUtils]: 88: Hoare triple {23410#false} assume 8673 == #t~mem80;havoc #t~mem80; {23410#false} is VALID [2022-04-27 15:27:09,860 INFO L290 TraceCheckUtils]: 89: Hoare triple {23410#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {23410#false} is VALID [2022-04-27 15:27:09,860 INFO L290 TraceCheckUtils]: 90: Hoare triple {23410#false} assume 4 == ~blastFlag~0; {23410#false} is VALID [2022-04-27 15:27:09,860 INFO L290 TraceCheckUtils]: 91: Hoare triple {23410#false} assume !false; {23410#false} is VALID [2022-04-27 15:27:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:27:09,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:09,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245747619] [2022-04-27 15:27:09,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245747619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:09,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:09,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:09,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895947406] [2022-04-27 15:27:09,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:09,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-27 15:27:09,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:09,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:09,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:09,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:09,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:09,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:09,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:09,915 INFO L87 Difference]: Start difference. First operand 256 states and 377 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:11,934 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:27:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:13,022 INFO L93 Difference]: Finished difference Result 577 states and 859 transitions. [2022-04-27 15:27:13,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:13,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-27 15:27:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 526 transitions. [2022-04-27 15:27:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 526 transitions. [2022-04-27 15:27:13,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 526 transitions. [2022-04-27 15:27:13,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 526 edges. 526 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:13,354 INFO L225 Difference]: With dead ends: 577 [2022-04-27 15:27:13,354 INFO L226 Difference]: Without dead ends: 347 [2022-04-27 15:27:13,355 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:27:13,355 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 68 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:13,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 465 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 511 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:27:13,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-04-27 15:27:13,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 299. [2022-04-27 15:27:13,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:13,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand has 299 states, 294 states have (on average 1.510204081632653) internal successors, (444), 294 states have internal predecessors, (444), 3 states have call successors, (3), 3 states 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:13,360 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states. Second operand has 299 states, 294 states have (on average 1.510204081632653) internal successors, (444), 294 states have internal predecessors, (444), 3 states have call successors, (3), 3 states 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:13,360 INFO L87 Difference]: Start difference. First operand 347 states. Second operand has 299 states, 294 states have (on average 1.510204081632653) internal successors, (444), 294 states have internal predecessors, (444), 3 states have call successors, (3), 3 states 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:13,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:13,364 INFO L93 Difference]: Finished difference Result 347 states and 511 transitions. [2022-04-27 15:27:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 511 transitions. [2022-04-27 15:27:13,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:13,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:13,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.510204081632653) internal successors, (444), 294 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 347 states. [2022-04-27 15:27:13,366 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.510204081632653) internal successors, (444), 294 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 347 states. [2022-04-27 15:27:13,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:13,370 INFO L93 Difference]: Finished difference Result 347 states and 511 transitions. [2022-04-27 15:27:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 511 transitions. [2022-04-27 15:27:13,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:13,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:13,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:13,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.510204081632653) internal successors, (444), 294 states have internal predecessors, (444), 3 states have call successors, (3), 3 states 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:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 448 transitions. [2022-04-27 15:27:13,375 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 448 transitions. Word has length 92 [2022-04-27 15:27:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:13,375 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 448 transitions. [2022-04-27 15:27:13,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 448 transitions. [2022-04-27 15:27:13,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-27 15:27:13,376 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:13,376 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:13,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:27:13,376 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2033353218, now seen corresponding path program 1 times [2022-04-27 15:27:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:13,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517494622] [2022-04-27 15:27:13,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:13,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:13,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {25128#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {25121#true} is VALID [2022-04-27 15:27:13,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {25121#true} assume true; {25121#true} is VALID [2022-04-27 15:27:13,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25121#true} {25121#true} #661#return; {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {25121#true} call ULTIMATE.init(); {25128#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:27:13,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {25128#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {25121#true} assume true; {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25121#true} {25121#true} #661#return; {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {25121#true} call #t~ret161 := main(); {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {25121#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; {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {25121#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L272 TraceCheckUtils]: 7: Hoare triple {25121#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {25121#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {25121#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {25121#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {25121#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {25121#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {25121#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {25121#true} assume !false; {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {25121#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {25121#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {25121#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {25121#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {25121#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {25121#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {25121#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {25121#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {25121#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {25121#true} assume 8464 == #t~mem55;havoc #t~mem55; {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {25121#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {25121#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {25121#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); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {25121#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {25121#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {25121#true} ~skip~0 := 0; {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {25121#true} assume !false; {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {25121#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {25121#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {25121#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {25121#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {25121#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 37: Hoare triple {25121#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 38: Hoare triple {25121#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,475 INFO L290 TraceCheckUtils]: 39: Hoare triple {25121#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,476 INFO L290 TraceCheckUtils]: 40: Hoare triple {25121#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,476 INFO L290 TraceCheckUtils]: 41: Hoare triple {25121#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,476 INFO L290 TraceCheckUtils]: 42: Hoare triple {25121#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,476 INFO L290 TraceCheckUtils]: 43: Hoare triple {25121#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,476 INFO L290 TraceCheckUtils]: 44: Hoare triple {25121#true} assume 8496 == #t~mem58;havoc #t~mem58; {25121#true} is VALID [2022-04-27 15:27:13,476 INFO L290 TraceCheckUtils]: 45: Hoare triple {25121#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {25121#true} is VALID [2022-04-27 15:27:13,476 INFO L290 TraceCheckUtils]: 46: Hoare triple {25121#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25121#true} is VALID [2022-04-27 15:27:13,476 INFO L290 TraceCheckUtils]: 47: Hoare triple {25121#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {25121#true} is VALID [2022-04-27 15:27:13,477 INFO L290 TraceCheckUtils]: 48: Hoare triple {25121#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,477 INFO L290 TraceCheckUtils]: 49: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,477 INFO L290 TraceCheckUtils]: 50: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,478 INFO L290 TraceCheckUtils]: 51: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,478 INFO L290 TraceCheckUtils]: 52: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,478 INFO L290 TraceCheckUtils]: 53: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,479 INFO L290 TraceCheckUtils]: 54: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,479 INFO L290 TraceCheckUtils]: 55: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,479 INFO L290 TraceCheckUtils]: 56: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,479 INFO L290 TraceCheckUtils]: 57: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,480 INFO L290 TraceCheckUtils]: 58: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,480 INFO L290 TraceCheckUtils]: 59: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,480 INFO L290 TraceCheckUtils]: 60: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,481 INFO L290 TraceCheckUtils]: 61: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,481 INFO L290 TraceCheckUtils]: 62: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,481 INFO L290 TraceCheckUtils]: 63: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,481 INFO L290 TraceCheckUtils]: 64: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,482 INFO L290 TraceCheckUtils]: 65: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,482 INFO L290 TraceCheckUtils]: 66: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:13,482 INFO L290 TraceCheckUtils]: 67: Hoare triple {25126#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25127#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-27 15:27:13,482 INFO L290 TraceCheckUtils]: 68: Hoare triple {25127#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 69: Hoare triple {25122#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 70: Hoare triple {25122#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 71: Hoare triple {25122#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 72: Hoare triple {25122#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 73: Hoare triple {25122#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 74: Hoare triple {25122#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 75: Hoare triple {25122#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 76: Hoare triple {25122#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 77: Hoare triple {25122#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 78: Hoare triple {25122#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 79: Hoare triple {25122#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 80: Hoare triple {25122#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 81: Hoare triple {25122#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 82: Hoare triple {25122#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 83: Hoare triple {25122#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 84: Hoare triple {25122#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 85: Hoare triple {25122#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 86: Hoare triple {25122#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,483 INFO L290 TraceCheckUtils]: 87: Hoare triple {25122#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {25122#false} is VALID [2022-04-27 15:27:13,484 INFO L290 TraceCheckUtils]: 88: Hoare triple {25122#false} assume 8673 == #t~mem80;havoc #t~mem80; {25122#false} is VALID [2022-04-27 15:27:13,484 INFO L290 TraceCheckUtils]: 89: Hoare triple {25122#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {25122#false} is VALID [2022-04-27 15:27:13,484 INFO L290 TraceCheckUtils]: 90: Hoare triple {25122#false} assume 4 == ~blastFlag~0; {25122#false} is VALID [2022-04-27 15:27:13,484 INFO L290 TraceCheckUtils]: 91: Hoare triple {25122#false} assume !false; {25122#false} is VALID [2022-04-27 15:27:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:27:13,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:13,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517494622] [2022-04-27 15:27:13,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517494622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:13,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:13,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:13,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707462197] [2022-04-27 15:27:13,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:13,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-27 15:27:13,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:13,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:13,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:13,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:13,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:13,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:13,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:13,574 INFO L87 Difference]: Start difference. First operand 299 states and 448 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:15,596 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:27:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:16,581 INFO L93 Difference]: Finished difference Result 617 states and 929 transitions. [2022-04-27 15:27:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:16,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-27 15:27:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-27 15:27:16,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-27 15:27:16,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 455 transitions. [2022-04-27 15:27:16,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:16,857 INFO L225 Difference]: With dead ends: 617 [2022-04-27 15:27:16,857 INFO L226 Difference]: Without dead ends: 344 [2022-04-27 15:27:16,858 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:27:16,858 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 32 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:16,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 565 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 439 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:27:16,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-04-27 15:27:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 323. [2022-04-27 15:27:16,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:16,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 344 states. Second operand has 323 states, 318 states have (on average 1.5062893081761006) internal successors, (479), 318 states have internal predecessors, (479), 3 states have call successors, (3), 3 states 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:16,863 INFO L74 IsIncluded]: Start isIncluded. First operand 344 states. Second operand has 323 states, 318 states have (on average 1.5062893081761006) internal successors, (479), 318 states have internal predecessors, (479), 3 states have call successors, (3), 3 states 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:16,863 INFO L87 Difference]: Start difference. First operand 344 states. Second operand has 323 states, 318 states have (on average 1.5062893081761006) internal successors, (479), 318 states have internal predecessors, (479), 3 states have call successors, (3), 3 states 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:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:16,867 INFO L93 Difference]: Finished difference Result 344 states and 510 transitions. [2022-04-27 15:27:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 510 transitions. [2022-04-27 15:27:16,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:16,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:16,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 323 states, 318 states have (on average 1.5062893081761006) internal successors, (479), 318 states have internal predecessors, (479), 3 states have call successors, (3), 3 states 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:27:16,868 INFO L87 Difference]: Start difference. First operand has 323 states, 318 states have (on average 1.5062893081761006) internal successors, (479), 318 states have internal predecessors, (479), 3 states have call successors, (3), 3 states 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:27:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:16,873 INFO L93 Difference]: Finished difference Result 344 states and 510 transitions. [2022-04-27 15:27:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 510 transitions. [2022-04-27 15:27:16,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:16,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:16,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:16,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 318 states have (on average 1.5062893081761006) internal successors, (479), 318 states have internal predecessors, (479), 3 states have call successors, (3), 3 states 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:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 483 transitions. [2022-04-27 15:27:16,878 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 483 transitions. Word has length 92 [2022-04-27 15:27:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:16,878 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 483 transitions. [2022-04-27 15:27:16,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:16,878 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 483 transitions. [2022-04-27 15:27:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-27 15:27:16,879 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:16,879 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:16,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:27:16,879 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:16,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1582990547, now seen corresponding path program 1 times [2022-04-27 15:27:16,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:16,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498636026] [2022-04-27 15:27:16,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:16,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:16,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {26893#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {26886#true} is VALID [2022-04-27 15:27:16,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {26886#true} assume true; {26886#true} is VALID [2022-04-27 15:27:16,971 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26886#true} {26886#true} #661#return; {26886#true} is VALID [2022-04-27 15:27:16,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {26886#true} call ULTIMATE.init(); {26893#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:27:16,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {26893#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {26886#true} is VALID [2022-04-27 15:27:16,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {26886#true} assume true; {26886#true} is VALID [2022-04-27 15:27:16,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26886#true} {26886#true} #661#return; {26886#true} is VALID [2022-04-27 15:27:16,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {26886#true} call #t~ret161 := main(); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {26886#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; {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {26886#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L272 TraceCheckUtils]: 7: Hoare triple {26886#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {26886#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {26886#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {26886#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {26886#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {26886#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {26886#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {26886#true} assume !false; {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {26886#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {26886#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {26886#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {26886#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {26886#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {26886#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {26886#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {26886#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {26886#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {26886#true} assume 8464 == #t~mem55;havoc #t~mem55; {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {26886#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {26886#true} is VALID [2022-04-27 15:27:16,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {26886#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26886#true} is VALID [2022-04-27 15:27:16,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {26886#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); {26891#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:16,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {26891#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26891#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:16,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {26891#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26891#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:16,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {26891#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {26891#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:16,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {26891#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {26891#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:16,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {26891#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26892#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-27 15:27:16,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {26892#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {26887#false} is VALID [2022-04-27 15:27:16,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {26887#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {26887#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {26887#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26887#false} is VALID [2022-04-27 15:27:16,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {26887#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {26887#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {26887#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {26887#false} is VALID [2022-04-27 15:27:16,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {26887#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {26887#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {26887#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {26887#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 44: Hoare triple {26887#false} ~skip~0 := 0; {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {26887#false} assume !false; {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {26887#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {26887#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {26887#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 49: Hoare triple {26887#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 50: Hoare triple {26887#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 51: Hoare triple {26887#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {26887#false} assume 8480 == #t~mem52;havoc #t~mem52; {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 53: Hoare triple {26887#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {26887#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 55: Hoare triple {26887#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {26887#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {26887#false} ~skip~0 := 0; {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {26887#false} assume !false; {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 59: Hoare triple {26887#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 60: Hoare triple {26887#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 61: Hoare triple {26887#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 62: Hoare triple {26887#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 63: Hoare triple {26887#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 64: Hoare triple {26887#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,976 INFO L290 TraceCheckUtils]: 65: Hoare triple {26887#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 66: Hoare triple {26887#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 67: Hoare triple {26887#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 68: Hoare triple {26887#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 69: Hoare triple {26887#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 70: Hoare triple {26887#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 71: Hoare triple {26887#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 72: Hoare triple {26887#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 73: Hoare triple {26887#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 74: Hoare triple {26887#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 75: Hoare triple {26887#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 76: Hoare triple {26887#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 77: Hoare triple {26887#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 78: Hoare triple {26887#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 79: Hoare triple {26887#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 80: Hoare triple {26887#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 81: Hoare triple {26887#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 82: Hoare triple {26887#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 83: Hoare triple {26887#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 84: Hoare triple {26887#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 85: Hoare triple {26887#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 86: Hoare triple {26887#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 87: Hoare triple {26887#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,977 INFO L290 TraceCheckUtils]: 88: Hoare triple {26887#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,978 INFO L290 TraceCheckUtils]: 89: Hoare triple {26887#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,978 INFO L290 TraceCheckUtils]: 90: Hoare triple {26887#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,978 INFO L290 TraceCheckUtils]: 91: Hoare triple {26887#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,978 INFO L290 TraceCheckUtils]: 92: Hoare triple {26887#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {26887#false} is VALID [2022-04-27 15:27:16,978 INFO L290 TraceCheckUtils]: 93: Hoare triple {26887#false} assume 8673 == #t~mem80;havoc #t~mem80; {26887#false} is VALID [2022-04-27 15:27:16,978 INFO L290 TraceCheckUtils]: 94: Hoare triple {26887#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {26887#false} is VALID [2022-04-27 15:27:16,978 INFO L290 TraceCheckUtils]: 95: Hoare triple {26887#false} assume 4 == ~blastFlag~0; {26887#false} is VALID [2022-04-27 15:27:16,978 INFO L290 TraceCheckUtils]: 96: Hoare triple {26887#false} assume !false; {26887#false} is VALID [2022-04-27 15:27:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:27:16,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:16,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498636026] [2022-04-27 15:27:16,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498636026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:16,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:16,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:16,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440520979] [2022-04-27 15:27:16,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:16,979 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 97 [2022-04-27 15:27:16,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:16,979 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:27:17,050 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:27:17,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:17,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:17,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:17,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:17,051 INFO L87 Difference]: Start difference. First operand 323 states and 483 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:27:21,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:27:23,930 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:25,950 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:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:26,931 INFO L93 Difference]: Finished difference Result 703 states and 1064 transitions. [2022-04-27 15:27:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:26,931 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 97 [2022-04-27 15:27:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:26,932 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:27:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 544 transitions. [2022-04-27 15:27:26,934 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:27:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 544 transitions. [2022-04-27 15:27:26,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 544 transitions. [2022-04-27 15:27:27,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 544 edges. 544 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:27,275 INFO L225 Difference]: With dead ends: 703 [2022-04-27 15:27:27,275 INFO L226 Difference]: Without dead ends: 406 [2022-04-27 15:27:27,275 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:27:27,276 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 128 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 55 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:27,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 338 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 450 Invalid, 3 Unknown, 0 Unchecked, 7.2s Time] [2022-04-27 15:27:27,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-04-27 15:27:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 323. [2022-04-27 15:27:27,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:27,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 406 states. Second operand has 323 states, 318 states have (on average 1.4874213836477987) internal successors, (473), 318 states have internal predecessors, (473), 3 states have call successors, (3), 3 states 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:27,280 INFO L74 IsIncluded]: Start isIncluded. First operand 406 states. Second operand has 323 states, 318 states have (on average 1.4874213836477987) internal successors, (473), 318 states have internal predecessors, (473), 3 states have call successors, (3), 3 states 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:27,281 INFO L87 Difference]: Start difference. First operand 406 states. Second operand has 323 states, 318 states have (on average 1.4874213836477987) internal successors, (473), 318 states have internal predecessors, (473), 3 states have call successors, (3), 3 states 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:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:27,287 INFO L93 Difference]: Finished difference Result 406 states and 605 transitions. [2022-04-27 15:27:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 605 transitions. [2022-04-27 15:27:27,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:27,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:27,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 323 states, 318 states have (on average 1.4874213836477987) internal successors, (473), 318 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 406 states. [2022-04-27 15:27:27,288 INFO L87 Difference]: Start difference. First operand has 323 states, 318 states have (on average 1.4874213836477987) internal successors, (473), 318 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 406 states. [2022-04-27 15:27:27,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:27,295 INFO L93 Difference]: Finished difference Result 406 states and 605 transitions. [2022-04-27 15:27:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 605 transitions. [2022-04-27 15:27:27,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:27,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:27,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:27,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 318 states have (on average 1.4874213836477987) internal successors, (473), 318 states have internal predecessors, (473), 3 states have call successors, (3), 3 states 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:27,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 477 transitions. [2022-04-27 15:27:27,300 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 477 transitions. Word has length 97 [2022-04-27 15:27:27,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:27,300 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 477 transitions. [2022-04-27 15:27:27,300 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:27:27,300 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 477 transitions. [2022-04-27 15:27:27,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 15:27:27,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:27,301 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:27,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:27:27,301 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:27,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:27,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1993787661, now seen corresponding path program 1 times [2022-04-27 15:27:27,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:27,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381942316] [2022-04-27 15:27:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:27,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:27,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:27,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {28883#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {28876#true} is VALID [2022-04-27 15:27:27,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {28876#true} assume true; {28876#true} is VALID [2022-04-27 15:27:27,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28876#true} {28876#true} #661#return; {28876#true} is VALID [2022-04-27 15:27:27,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {28876#true} call ULTIMATE.init(); {28883#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:27:27,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {28883#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {28876#true} assume true; {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28876#true} {28876#true} #661#return; {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {28876#true} call #t~ret161 := main(); {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {28876#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; {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {28876#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L272 TraceCheckUtils]: 7: Hoare triple {28876#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {28876#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {28876#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {28876#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {28876#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {28876#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {28876#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {28876#true} assume !false; {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {28876#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {28876#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {28876#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {28876#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {28876#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {28876#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {28876#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {28876#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {28876#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {28876#true} assume 8464 == #t~mem55;havoc #t~mem55; {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {28876#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {28876#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {28876#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); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {28876#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {28876#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {28876#true} ~skip~0 := 0; {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {28876#true} assume !false; {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {28876#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {28876#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {28876#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {28876#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {28876#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {28876#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {28876#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {28876#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {28876#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 41: Hoare triple {28876#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 42: Hoare triple {28876#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {28876#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {28876#true} assume 8496 == #t~mem58;havoc #t~mem58; {28876#true} is VALID [2022-04-27 15:27:27,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {28876#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {28876#true} is VALID [2022-04-27 15:27:27,441 INFO L290 TraceCheckUtils]: 46: Hoare triple {28876#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {28876#true} is VALID [2022-04-27 15:27:27,441 INFO L290 TraceCheckUtils]: 47: Hoare triple {28876#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {28876#true} is VALID [2022-04-27 15:27:27,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {28876#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,442 INFO L290 TraceCheckUtils]: 50: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,443 INFO L290 TraceCheckUtils]: 52: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,443 INFO L290 TraceCheckUtils]: 53: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,443 INFO L290 TraceCheckUtils]: 54: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,444 INFO L290 TraceCheckUtils]: 56: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,444 INFO L290 TraceCheckUtils]: 57: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,444 INFO L290 TraceCheckUtils]: 58: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,445 INFO L290 TraceCheckUtils]: 59: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,445 INFO L290 TraceCheckUtils]: 60: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,446 INFO L290 TraceCheckUtils]: 62: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,446 INFO L290 TraceCheckUtils]: 63: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,446 INFO L290 TraceCheckUtils]: 64: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,447 INFO L290 TraceCheckUtils]: 65: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,447 INFO L290 TraceCheckUtils]: 66: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:27,447 INFO L290 TraceCheckUtils]: 67: Hoare triple {28881#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28882#(= |ssl3_accept_#t~mem60| 8656)} is VALID [2022-04-27 15:27:27,447 INFO L290 TraceCheckUtils]: 68: Hoare triple {28882#(= |ssl3_accept_#t~mem60| 8656)} assume 8512 == #t~mem60;havoc #t~mem60; {28877#false} is VALID [2022-04-27 15:27:27,447 INFO L290 TraceCheckUtils]: 69: Hoare triple {28877#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,448 INFO L290 TraceCheckUtils]: 70: Hoare triple {28877#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 71: Hoare triple {28877#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 72: Hoare triple {28877#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 73: Hoare triple {28877#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 74: Hoare triple {28877#false} ~skip~0 := 0; {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 75: Hoare triple {28877#false} assume !false; {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 76: Hoare triple {28877#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 77: Hoare triple {28877#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 78: Hoare triple {28877#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 79: Hoare triple {28877#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 80: Hoare triple {28877#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 81: Hoare triple {28877#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 82: Hoare triple {28877#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 83: Hoare triple {28877#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 84: Hoare triple {28877#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 85: Hoare triple {28877#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 86: Hoare triple {28877#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 87: Hoare triple {28877#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 88: Hoare triple {28877#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 89: Hoare triple {28877#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 90: Hoare triple {28877#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 91: Hoare triple {28877#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,449 INFO L290 TraceCheckUtils]: 92: Hoare triple {28877#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 93: Hoare triple {28877#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 94: Hoare triple {28877#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 95: Hoare triple {28877#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 96: Hoare triple {28877#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 97: Hoare triple {28877#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 98: Hoare triple {28877#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 99: Hoare triple {28877#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 100: Hoare triple {28877#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 101: Hoare triple {28877#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 102: Hoare triple {28877#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 103: Hoare triple {28877#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 104: Hoare triple {28877#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 105: Hoare triple {28877#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 106: Hoare triple {28877#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 107: Hoare triple {28877#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 108: Hoare triple {28877#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 109: Hoare triple {28877#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 110: Hoare triple {28877#false} assume 8673 == #t~mem80;havoc #t~mem80; {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 111: Hoare triple {28877#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 112: Hoare triple {28877#false} assume 4 == ~blastFlag~0; {28877#false} is VALID [2022-04-27 15:27:27,450 INFO L290 TraceCheckUtils]: 113: Hoare triple {28877#false} assume !false; {28877#false} is VALID [2022-04-27 15:27:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:27:27,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:27,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381942316] [2022-04-27 15:27:27,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381942316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:27,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:27,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:27,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159832700] [2022-04-27 15:27:27,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:27,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-27 15:27:27,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:27,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:27,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:27,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:27,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:27,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:27,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:27,520 INFO L87 Difference]: Start difference. First operand 323 states and 477 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:29,545 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:27:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:30,593 INFO L93 Difference]: Finished difference Result 658 states and 975 transitions. [2022-04-27 15:27:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:30,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-27 15:27:30,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-04-27 15:27:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-04-27 15:27:30,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 512 transitions. [2022-04-27 15:27:30,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 512 edges. 512 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:30,907 INFO L225 Difference]: With dead ends: 658 [2022-04-27 15:27:30,907 INFO L226 Difference]: Without dead ends: 361 [2022-04-27 15:27:30,908 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:27:30,908 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 77 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:30,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 465 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 487 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:27:30,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-04-27 15:27:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 323. [2022-04-27 15:27:30,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:30,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 361 states. Second operand has 323 states, 318 states have (on average 1.4842767295597483) internal successors, (472), 318 states have internal predecessors, (472), 3 states have call successors, (3), 3 states 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:30,913 INFO L74 IsIncluded]: Start isIncluded. First operand 361 states. Second operand has 323 states, 318 states have (on average 1.4842767295597483) internal successors, (472), 318 states have internal predecessors, (472), 3 states have call successors, (3), 3 states 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:30,913 INFO L87 Difference]: Start difference. First operand 361 states. Second operand has 323 states, 318 states have (on average 1.4842767295597483) internal successors, (472), 318 states have internal predecessors, (472), 3 states have call successors, (3), 3 states 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:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:30,918 INFO L93 Difference]: Finished difference Result 361 states and 527 transitions. [2022-04-27 15:27:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 527 transitions. [2022-04-27 15:27:30,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:30,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:30,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 323 states, 318 states have (on average 1.4842767295597483) internal successors, (472), 318 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 361 states. [2022-04-27 15:27:30,920 INFO L87 Difference]: Start difference. First operand has 323 states, 318 states have (on average 1.4842767295597483) internal successors, (472), 318 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 361 states. [2022-04-27 15:27:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:30,925 INFO L93 Difference]: Finished difference Result 361 states and 527 transitions. [2022-04-27 15:27:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 527 transitions. [2022-04-27 15:27:30,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:30,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:30,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:30,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 318 states have (on average 1.4842767295597483) internal successors, (472), 318 states have internal predecessors, (472), 3 states have call successors, (3), 3 states 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:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 476 transitions. [2022-04-27 15:27:30,930 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 476 transitions. Word has length 114 [2022-04-27 15:27:30,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:30,930 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 476 transitions. [2022-04-27 15:27:30,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:30,930 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 476 transitions. [2022-04-27 15:27:30,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 15:27:30,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:30,931 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:30,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:27:30,931 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:30,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1569212209, now seen corresponding path program 1 times [2022-04-27 15:27:30,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:30,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871095802] [2022-04-27 15:27:30,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:31,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {30733#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {30727#true} is VALID [2022-04-27 15:27:31,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {30727#true} assume true; {30727#true} is VALID [2022-04-27 15:27:31,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30727#true} {30727#true} #661#return; {30727#true} is VALID [2022-04-27 15:27:31,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {30727#true} call ULTIMATE.init(); {30733#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:27:31,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {30733#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {30727#true} is VALID [2022-04-27 15:27:31,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {30727#true} assume true; {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30727#true} {30727#true} #661#return; {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {30727#true} call #t~ret161 := main(); {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {30727#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; {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {30727#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L272 TraceCheckUtils]: 7: Hoare triple {30727#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {30727#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {30727#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {30727#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {30727#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {30727#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {30727#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {30727#true} assume !false; {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {30727#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {30727#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {30727#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {30727#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {30727#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {30727#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {30727#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {30727#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {30727#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {30727#true} assume 8464 == #t~mem55;havoc #t~mem55; {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {30727#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {30727#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {30727#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); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {30727#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {30727#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {30727#true} ~skip~0 := 0; {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {30727#true} assume !false; {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {30727#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {30727#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {30727#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {30727#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {30727#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {30727#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {30727#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {30727#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {30727#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {30727#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 42: Hoare triple {30727#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 43: Hoare triple {30727#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {30727#true} assume 8496 == #t~mem58;havoc #t~mem58; {30727#true} is VALID [2022-04-27 15:27:31,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {30727#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {30727#true} is VALID [2022-04-27 15:27:31,067 INFO L290 TraceCheckUtils]: 46: Hoare triple {30727#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,067 INFO L290 TraceCheckUtils]: 47: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,067 INFO L290 TraceCheckUtils]: 49: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,068 INFO L290 TraceCheckUtils]: 51: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,068 INFO L290 TraceCheckUtils]: 52: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,068 INFO L290 TraceCheckUtils]: 53: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,069 INFO L290 TraceCheckUtils]: 55: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,070 INFO L290 TraceCheckUtils]: 59: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,071 INFO L290 TraceCheckUtils]: 66: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,071 INFO L290 TraceCheckUtils]: 67: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,071 INFO L290 TraceCheckUtils]: 68: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,072 INFO L290 TraceCheckUtils]: 69: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,072 INFO L290 TraceCheckUtils]: 70: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,072 INFO L290 TraceCheckUtils]: 71: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,072 INFO L290 TraceCheckUtils]: 72: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,073 INFO L290 TraceCheckUtils]: 73: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,073 INFO L290 TraceCheckUtils]: 74: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,073 INFO L290 TraceCheckUtils]: 75: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,073 INFO L290 TraceCheckUtils]: 76: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,073 INFO L290 TraceCheckUtils]: 77: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,074 INFO L290 TraceCheckUtils]: 78: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,074 INFO L290 TraceCheckUtils]: 79: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,074 INFO L290 TraceCheckUtils]: 80: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,074 INFO L290 TraceCheckUtils]: 81: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,075 INFO L290 TraceCheckUtils]: 82: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,075 INFO L290 TraceCheckUtils]: 83: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,075 INFO L290 TraceCheckUtils]: 84: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,075 INFO L290 TraceCheckUtils]: 85: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,075 INFO L290 TraceCheckUtils]: 86: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,076 INFO L290 TraceCheckUtils]: 87: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,076 INFO L290 TraceCheckUtils]: 88: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,076 INFO L290 TraceCheckUtils]: 89: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,076 INFO L290 TraceCheckUtils]: 90: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,076 INFO L290 TraceCheckUtils]: 91: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,077 INFO L290 TraceCheckUtils]: 92: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,077 INFO L290 TraceCheckUtils]: 93: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,077 INFO L290 TraceCheckUtils]: 94: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,077 INFO L290 TraceCheckUtils]: 95: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,078 INFO L290 TraceCheckUtils]: 96: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,078 INFO L290 TraceCheckUtils]: 97: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,078 INFO L290 TraceCheckUtils]: 98: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,078 INFO L290 TraceCheckUtils]: 99: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,078 INFO L290 TraceCheckUtils]: 100: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,079 INFO L290 TraceCheckUtils]: 101: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,079 INFO L290 TraceCheckUtils]: 102: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,079 INFO L290 TraceCheckUtils]: 103: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,079 INFO L290 TraceCheckUtils]: 104: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,079 INFO L290 TraceCheckUtils]: 105: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,080 INFO L290 TraceCheckUtils]: 106: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,080 INFO L290 TraceCheckUtils]: 107: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,080 INFO L290 TraceCheckUtils]: 108: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,080 INFO L290 TraceCheckUtils]: 109: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,081 INFO L290 TraceCheckUtils]: 110: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume 8673 == #t~mem80;havoc #t~mem80; {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,081 INFO L290 TraceCheckUtils]: 111: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {30732#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:31,081 INFO L290 TraceCheckUtils]: 112: Hoare triple {30732#(= 2 ssl3_accept_~blastFlag~0)} assume 4 == ~blastFlag~0; {30728#false} is VALID [2022-04-27 15:27:31,081 INFO L290 TraceCheckUtils]: 113: Hoare triple {30728#false} assume !false; {30728#false} is VALID [2022-04-27 15:27:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 15:27:31,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:31,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871095802] [2022-04-27 15:27:31,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871095802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:31,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:31,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:27:31,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325750707] [2022-04-27 15:27:31,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:31,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-27 15:27:31,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:31,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:31,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:31,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:27:31,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:31,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:27:31,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:27:31,141 INFO L87 Difference]: Start difference. First operand 323 states and 476 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:33,157 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:27:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:33,821 INFO L93 Difference]: Finished difference Result 894 states and 1340 transitions. [2022-04-27 15:27:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:27:33,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-27 15:27:33,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:33,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 572 transitions. [2022-04-27 15:27:33,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 572 transitions. [2022-04-27 15:27:33,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 572 transitions. [2022-04-27 15:27:34,164 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:27:34,175 INFO L225 Difference]: With dead ends: 894 [2022-04-27 15:27:34,175 INFO L226 Difference]: Without dead ends: 597 [2022-04-27 15:27:34,176 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:27:34,176 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 129 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:34,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 427 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 251 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:27:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-04-27 15:27:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2022-04-27 15:27:34,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:34,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 597 states. Second operand has 597 states, 592 states have (on average 1.4966216216216217) internal successors, (886), 592 states have internal predecessors, (886), 3 states have call successors, (3), 3 states 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:34,184 INFO L74 IsIncluded]: Start isIncluded. First operand 597 states. Second operand has 597 states, 592 states have (on average 1.4966216216216217) internal successors, (886), 592 states have internal predecessors, (886), 3 states have call successors, (3), 3 states 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:34,184 INFO L87 Difference]: Start difference. First operand 597 states. Second operand has 597 states, 592 states have (on average 1.4966216216216217) internal successors, (886), 592 states have internal predecessors, (886), 3 states have call successors, (3), 3 states 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:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:34,195 INFO L93 Difference]: Finished difference Result 597 states and 890 transitions. [2022-04-27 15:27:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 890 transitions. [2022-04-27 15:27:34,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:34,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:34,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 597 states, 592 states have (on average 1.4966216216216217) internal successors, (886), 592 states have internal predecessors, (886), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 597 states. [2022-04-27 15:27:34,197 INFO L87 Difference]: Start difference. First operand has 597 states, 592 states have (on average 1.4966216216216217) internal successors, (886), 592 states have internal predecessors, (886), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 597 states. [2022-04-27 15:27:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:34,208 INFO L93 Difference]: Finished difference Result 597 states and 890 transitions. [2022-04-27 15:27:34,208 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 890 transitions. [2022-04-27 15:27:34,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:34,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:34,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:34,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 592 states have (on average 1.4966216216216217) internal successors, (886), 592 states have internal predecessors, (886), 3 states have call successors, (3), 3 states 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:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 890 transitions. [2022-04-27 15:27:34,221 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 890 transitions. Word has length 114 [2022-04-27 15:27:34,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:34,221 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 890 transitions. [2022-04-27 15:27:34,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 890 transitions. [2022-04-27 15:27:34,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 15:27:34,222 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:34,223 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:34,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 15:27:34,223 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:34,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:34,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1771814929, now seen corresponding path program 1 times [2022-04-27 15:27:34,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:34,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269370216] [2022-04-27 15:27:34,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:34,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:34,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:34,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {33615#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {33609#true} is VALID [2022-04-27 15:27:34,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {33609#true} assume true; {33609#true} is VALID [2022-04-27 15:27:34,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33609#true} {33609#true} #661#return; {33609#true} is VALID [2022-04-27 15:27:34,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {33609#true} call ULTIMATE.init(); {33615#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:27:34,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {33615#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {33609#true} is VALID [2022-04-27 15:27:34,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {33609#true} assume true; {33609#true} is VALID [2022-04-27 15:27:34,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33609#true} {33609#true} #661#return; {33609#true} is VALID [2022-04-27 15:27:34,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {33609#true} call #t~ret161 := main(); {33609#true} is VALID [2022-04-27 15:27:34,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {33609#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; {33609#true} is VALID [2022-04-27 15:27:34,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {33609#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {33609#true} is VALID [2022-04-27 15:27:34,312 INFO L272 TraceCheckUtils]: 7: Hoare triple {33609#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {33609#true} is VALID [2022-04-27 15:27:34,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {33609#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {33609#true} is VALID [2022-04-27 15:27:34,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {33609#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {33609#true} is VALID [2022-04-27 15:27:34,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {33609#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {33609#true} is VALID [2022-04-27 15:27:34,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {33609#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {33609#true} is VALID [2022-04-27 15:27:34,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {33609#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {33609#true} is VALID [2022-04-27 15:27:34,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {33609#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {33609#true} is VALID [2022-04-27 15:27:34,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {33609#true} assume !false; {33609#true} is VALID [2022-04-27 15:27:34,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {33609#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33609#true} is VALID [2022-04-27 15:27:34,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {33609#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33609#true} is VALID [2022-04-27 15:27:34,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {33609#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33609#true} is VALID [2022-04-27 15:27:34,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {33609#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33609#true} is VALID [2022-04-27 15:27:34,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {33609#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33609#true} is VALID [2022-04-27 15:27:34,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {33609#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33609#true} is VALID [2022-04-27 15:27:34,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {33609#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33609#true} is VALID [2022-04-27 15:27:34,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {33609#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33609#true} is VALID [2022-04-27 15:27:34,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {33609#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33609#true} is VALID [2022-04-27 15:27:34,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {33609#true} assume 8464 == #t~mem55;havoc #t~mem55; {33609#true} is VALID [2022-04-27 15:27:34,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {33609#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {33609#true} is VALID [2022-04-27 15:27:34,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {33609#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {33614#(= 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); {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume !false; {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {33614#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:34,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {33614#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {33610#false} is VALID [2022-04-27 15:27:34,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {33610#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {33610#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {33610#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {33610#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {33610#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {33610#false} ~skip~0 := 0; {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {33610#false} assume !false; {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {33610#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 55: Hoare triple {33610#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {33610#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {33610#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 58: Hoare triple {33610#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 59: Hoare triple {33610#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 60: Hoare triple {33610#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 61: Hoare triple {33610#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 62: Hoare triple {33610#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 63: Hoare triple {33610#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {33610#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 65: Hoare triple {33610#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 66: Hoare triple {33610#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 67: Hoare triple {33610#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {33610#false} assume 8512 == #t~mem60;havoc #t~mem60; {33610#false} is VALID [2022-04-27 15:27:34,319 INFO L290 TraceCheckUtils]: 69: Hoare triple {33610#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 70: Hoare triple {33610#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 71: Hoare triple {33610#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 72: Hoare triple {33610#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 73: Hoare triple {33610#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 74: Hoare triple {33610#false} ~skip~0 := 0; {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 75: Hoare triple {33610#false} assume !false; {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 76: Hoare triple {33610#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 77: Hoare triple {33610#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 78: Hoare triple {33610#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 79: Hoare triple {33610#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 80: Hoare triple {33610#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 81: Hoare triple {33610#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 82: Hoare triple {33610#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 83: Hoare triple {33610#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 84: Hoare triple {33610#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 85: Hoare triple {33610#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 86: Hoare triple {33610#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 87: Hoare triple {33610#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 88: Hoare triple {33610#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 89: Hoare triple {33610#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 90: Hoare triple {33610#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,320 INFO L290 TraceCheckUtils]: 91: Hoare triple {33610#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 92: Hoare triple {33610#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 93: Hoare triple {33610#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 94: Hoare triple {33610#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 95: Hoare triple {33610#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 96: Hoare triple {33610#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 97: Hoare triple {33610#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 98: Hoare triple {33610#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 99: Hoare triple {33610#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 100: Hoare triple {33610#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 101: Hoare triple {33610#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 102: Hoare triple {33610#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 103: Hoare triple {33610#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 104: Hoare triple {33610#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 105: Hoare triple {33610#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 106: Hoare triple {33610#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 107: Hoare triple {33610#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 108: Hoare triple {33610#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 109: Hoare triple {33610#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 110: Hoare triple {33610#false} assume 8673 == #t~mem80;havoc #t~mem80; {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 111: Hoare triple {33610#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 112: Hoare triple {33610#false} assume 4 == ~blastFlag~0; {33610#false} is VALID [2022-04-27 15:27:34,321 INFO L290 TraceCheckUtils]: 113: Hoare triple {33610#false} assume !false; {33610#false} is VALID [2022-04-27 15:27:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 15:27:34,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:34,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269370216] [2022-04-27 15:27:34,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269370216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:34,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:34,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:27:34,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231168621] [2022-04-27 15:27:34,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:34,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have 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:27:34,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:34,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states 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:34,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:34,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:27:34,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:34,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:27:34,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:27:34,383 INFO L87 Difference]: Start difference. First operand 597 states and 890 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states 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:36,400 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:27:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:37,040 INFO L93 Difference]: Finished difference Result 1195 states and 1787 transitions. [2022-04-27 15:27:37,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:27:37,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have 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:27:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states 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:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2022-04-27 15:27:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states 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:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2022-04-27 15:27:37,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 428 transitions. [2022-04-27 15:27:37,302 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:27:37,314 INFO L225 Difference]: With dead ends: 1195 [2022-04-27 15:27:37,314 INFO L226 Difference]: Without dead ends: 624 [2022-04-27 15:27:37,315 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:27:37,316 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:37,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 407 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 227 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:27:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-04-27 15:27:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2022-04-27 15:27:37,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:37,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 624 states. Second operand has 624 states, 619 states have (on average 1.4878836833602584) internal successors, (921), 619 states have internal predecessors, (921), 3 states have call successors, (3), 3 states 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:37,324 INFO L74 IsIncluded]: Start isIncluded. First operand 624 states. Second operand has 624 states, 619 states have (on average 1.4878836833602584) internal successors, (921), 619 states have internal predecessors, (921), 3 states have call successors, (3), 3 states 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:37,324 INFO L87 Difference]: Start difference. First operand 624 states. Second operand has 624 states, 619 states have (on average 1.4878836833602584) internal successors, (921), 619 states have internal predecessors, (921), 3 states have call successors, (3), 3 states 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:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:37,336 INFO L93 Difference]: Finished difference Result 624 states and 925 transitions. [2022-04-27 15:27:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 925 transitions. [2022-04-27 15:27:37,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:37,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:37,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 624 states, 619 states have (on average 1.4878836833602584) internal successors, (921), 619 states have internal predecessors, (921), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 624 states. [2022-04-27 15:27:37,338 INFO L87 Difference]: Start difference. First operand has 624 states, 619 states have (on average 1.4878836833602584) internal successors, (921), 619 states have internal predecessors, (921), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 624 states. [2022-04-27 15:27:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:37,350 INFO L93 Difference]: Finished difference Result 624 states and 925 transitions. [2022-04-27 15:27:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 925 transitions. [2022-04-27 15:27:37,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:37,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:37,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:37,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 619 states have (on average 1.4878836833602584) internal successors, (921), 619 states have internal predecessors, (921), 3 states have call successors, (3), 3 states 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:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 925 transitions. [2022-04-27 15:27:37,364 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 925 transitions. Word has length 114 [2022-04-27 15:27:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:37,365 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 925 transitions. [2022-04-27 15:27:37,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states 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:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 925 transitions. [2022-04-27 15:27:37,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 15:27:37,366 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:37,366 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:37,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 15:27:37,366 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:37,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:37,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1528458669, now seen corresponding path program 1 times [2022-04-27 15:27:37,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:37,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393558179] [2022-04-27 15:27:37,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:37,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:37,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:37,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {36920#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {36914#true} is VALID [2022-04-27 15:27:37,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {36914#true} assume true; {36914#true} is VALID [2022-04-27 15:27:37,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36914#true} {36914#true} #661#return; {36914#true} is VALID [2022-04-27 15:27:37,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {36914#true} call ULTIMATE.init(); {36920#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:27:37,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {36920#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {36914#true} is VALID [2022-04-27 15:27:37,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {36914#true} assume true; {36914#true} is VALID [2022-04-27 15:27:37,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36914#true} {36914#true} #661#return; {36914#true} is VALID [2022-04-27 15:27:37,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {36914#true} call #t~ret161 := main(); {36914#true} is VALID [2022-04-27 15:27:37,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {36914#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; {36914#true} is VALID [2022-04-27 15:27:37,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {36914#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {36914#true} is VALID [2022-04-27 15:27:37,456 INFO L272 TraceCheckUtils]: 7: Hoare triple {36914#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {36914#true} is VALID [2022-04-27 15:27:37,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {36914#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {36919#(= 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)))); {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} assume !false; {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {36919#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:37,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {36919#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {36915#false} is VALID [2022-04-27 15:27:37,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {36915#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); {36915#false} is VALID [2022-04-27 15:27:37,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {36915#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {36915#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36915#false} is VALID [2022-04-27 15:27:37,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {36915#false} ~skip~0 := 0; {36915#false} is VALID [2022-04-27 15:27:37,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {36915#false} assume !false; {36915#false} is VALID [2022-04-27 15:27:37,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {36915#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {36915#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {36915#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {36915#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {36915#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {36915#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {36915#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {36915#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {36915#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {36915#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {36915#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {36915#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {36915#false} assume 8496 == #t~mem58;havoc #t~mem58; {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {36915#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {36915#false} assume !(1 == ~blastFlag~0); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 47: Hoare triple {36915#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {36915#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {36915#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 50: Hoare triple {36915#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {36915#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {36915#false} ~skip~0 := 0; {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {36915#false} assume !false; {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {36915#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {36915#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {36915#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 57: Hoare triple {36915#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 58: Hoare triple {36915#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 59: Hoare triple {36915#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,461 INFO L290 TraceCheckUtils]: 60: Hoare triple {36915#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {36915#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,462 INFO L290 TraceCheckUtils]: 62: Hoare triple {36915#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,462 INFO L290 TraceCheckUtils]: 63: Hoare triple {36915#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,462 INFO L290 TraceCheckUtils]: 64: Hoare triple {36915#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,462 INFO L290 TraceCheckUtils]: 65: Hoare triple {36915#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,462 INFO L290 TraceCheckUtils]: 66: Hoare triple {36915#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,462 INFO L290 TraceCheckUtils]: 67: Hoare triple {36915#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,462 INFO L290 TraceCheckUtils]: 68: Hoare triple {36915#false} assume 8512 == #t~mem60;havoc #t~mem60; {36915#false} is VALID [2022-04-27 15:27:37,462 INFO L290 TraceCheckUtils]: 69: Hoare triple {36915#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,462 INFO L290 TraceCheckUtils]: 70: Hoare triple {36915#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {36915#false} is VALID [2022-04-27 15:27:37,462 INFO L290 TraceCheckUtils]: 71: Hoare triple {36915#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,462 INFO L290 TraceCheckUtils]: 72: Hoare triple {36915#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,462 INFO L290 TraceCheckUtils]: 73: Hoare triple {36915#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36915#false} is VALID [2022-04-27 15:27:37,462 INFO L290 TraceCheckUtils]: 74: Hoare triple {36915#false} ~skip~0 := 0; {36915#false} is VALID [2022-04-27 15:27:37,463 INFO L290 TraceCheckUtils]: 75: Hoare triple {36915#false} assume !false; {36915#false} is VALID [2022-04-27 15:27:37,463 INFO L290 TraceCheckUtils]: 76: Hoare triple {36915#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,463 INFO L290 TraceCheckUtils]: 77: Hoare triple {36915#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,463 INFO L290 TraceCheckUtils]: 78: Hoare triple {36915#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,463 INFO L290 TraceCheckUtils]: 79: Hoare triple {36915#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,463 INFO L290 TraceCheckUtils]: 80: Hoare triple {36915#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,463 INFO L290 TraceCheckUtils]: 81: Hoare triple {36915#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,463 INFO L290 TraceCheckUtils]: 82: Hoare triple {36915#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,463 INFO L290 TraceCheckUtils]: 83: Hoare triple {36915#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 84: Hoare triple {36915#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 85: Hoare triple {36915#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 86: Hoare triple {36915#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 87: Hoare triple {36915#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 88: Hoare triple {36915#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 89: Hoare triple {36915#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 90: Hoare triple {36915#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 91: Hoare triple {36915#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 92: Hoare triple {36915#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 93: Hoare triple {36915#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 94: Hoare triple {36915#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 95: Hoare triple {36915#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 96: Hoare triple {36915#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 97: Hoare triple {36915#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 98: Hoare triple {36915#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 99: Hoare triple {36915#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 100: Hoare triple {36915#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 101: Hoare triple {36915#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 102: Hoare triple {36915#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 103: Hoare triple {36915#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 104: Hoare triple {36915#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,464 INFO L290 TraceCheckUtils]: 105: Hoare triple {36915#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,465 INFO L290 TraceCheckUtils]: 106: Hoare triple {36915#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,465 INFO L290 TraceCheckUtils]: 107: Hoare triple {36915#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,465 INFO L290 TraceCheckUtils]: 108: Hoare triple {36915#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,465 INFO L290 TraceCheckUtils]: 109: Hoare triple {36915#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {36915#false} is VALID [2022-04-27 15:27:37,465 INFO L290 TraceCheckUtils]: 110: Hoare triple {36915#false} assume 8673 == #t~mem80;havoc #t~mem80; {36915#false} is VALID [2022-04-27 15:27:37,465 INFO L290 TraceCheckUtils]: 111: Hoare triple {36915#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {36915#false} is VALID [2022-04-27 15:27:37,465 INFO L290 TraceCheckUtils]: 112: Hoare triple {36915#false} assume 4 == ~blastFlag~0; {36915#false} is VALID [2022-04-27 15:27:37,465 INFO L290 TraceCheckUtils]: 113: Hoare triple {36915#false} assume !false; {36915#false} is VALID [2022-04-27 15:27:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-04-27 15:27:37,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:37,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393558179] [2022-04-27 15:27:37,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393558179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:37,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:37,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:27:37,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011634597] [2022-04-27 15:27:37,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:37,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-27 15:27:37,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:37,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:37,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:37,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:27:37,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:37,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:27:37,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:27:37,515 INFO L87 Difference]: Start difference. First operand 624 states and 925 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:39,530 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:27:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:40,127 INFO L93 Difference]: Finished difference Result 1224 states and 1823 transitions. [2022-04-27 15:27:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:27:40,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-27 15:27:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2022-04-27 15:27:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2022-04-27 15:27:40,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 405 transitions. [2022-04-27 15:27:40,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 405 edges. 405 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:40,387 INFO L225 Difference]: With dead ends: 1224 [2022-04-27 15:27:40,387 INFO L226 Difference]: Without dead ends: 626 [2022-04-27 15:27:40,388 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:27:40,388 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:40,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 386 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:27:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-04-27 15:27:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2022-04-27 15:27:40,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:40,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 626 states. Second operand has 626 states, 621 states have (on average 1.4863123993558776) internal successors, (923), 621 states have internal predecessors, (923), 3 states have call successors, (3), 3 states 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:40,396 INFO L74 IsIncluded]: Start isIncluded. First operand 626 states. Second operand has 626 states, 621 states have (on average 1.4863123993558776) internal successors, (923), 621 states have internal predecessors, (923), 3 states have call successors, (3), 3 states 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:40,397 INFO L87 Difference]: Start difference. First operand 626 states. Second operand has 626 states, 621 states have (on average 1.4863123993558776) internal successors, (923), 621 states have internal predecessors, (923), 3 states have call successors, (3), 3 states 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:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:40,408 INFO L93 Difference]: Finished difference Result 626 states and 927 transitions. [2022-04-27 15:27:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 927 transitions. [2022-04-27 15:27:40,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:40,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:40,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 626 states, 621 states have (on average 1.4863123993558776) internal successors, (923), 621 states have internal predecessors, (923), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 626 states. [2022-04-27 15:27:40,410 INFO L87 Difference]: Start difference. First operand has 626 states, 621 states have (on average 1.4863123993558776) internal successors, (923), 621 states have internal predecessors, (923), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 626 states. [2022-04-27 15:27:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:40,423 INFO L93 Difference]: Finished difference Result 626 states and 927 transitions. [2022-04-27 15:27:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 927 transitions. [2022-04-27 15:27:40,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:40,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:40,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:40,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 621 states have (on average 1.4863123993558776) internal successors, (923), 621 states have internal predecessors, (923), 3 states have call successors, (3), 3 states 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:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 927 transitions. [2022-04-27 15:27:40,437 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 927 transitions. Word has length 114 [2022-04-27 15:27:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:40,437 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 927 transitions. [2022-04-27 15:27:40,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 927 transitions. [2022-04-27 15:27:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-27 15:27:40,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:40,438 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:27:40,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 15:27:40,438 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:40,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:40,439 INFO L85 PathProgramCache]: Analyzing trace with hash 716472108, now seen corresponding path program 1 times [2022-04-27 15:27:40,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:40,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041855060] [2022-04-27 15:27:40,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:40,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:40,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:40,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {40269#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {40260#true} is VALID [2022-04-27 15:27:40,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {40260#true} assume true; {40260#true} is VALID [2022-04-27 15:27:40,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40260#true} {40260#true} #661#return; {40260#true} is VALID [2022-04-27 15:27:40,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {40260#true} call ULTIMATE.init(); {40269#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:27:40,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {40269#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.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); {40260#true} is VALID [2022-04-27 15:27:40,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {40260#true} assume true; {40260#true} is VALID [2022-04-27 15:27:40,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40260#true} {40260#true} #661#return; {40260#true} is VALID [2022-04-27 15:27:40,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {40260#true} call #t~ret161 := main(); {40260#true} is VALID [2022-04-27 15:27:40,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {40260#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; {40260#true} is VALID [2022-04-27 15:27:40,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {40260#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {40265#(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:27:40,792 INFO L272 TraceCheckUtils]: 7: Hoare triple {40265#(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); {40266#(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:27:40,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {40266#(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;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {40267#(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:27:40,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {40267#(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~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {40267#(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:27:40,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {40267#(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~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {40267#(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:27:40,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {40267#(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)))); {40267#(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:27:40,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {40267#(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~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {40268#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-27 15:27:40,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {40268#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {40261#false} is VALID [2022-04-27 15:27:40,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {40261#false} assume !false; {40261#false} is VALID [2022-04-27 15:27:40,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {40261#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {40261#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {40261#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {40261#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {40261#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {40261#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {40261#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {40261#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {40261#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {40261#false} assume 8464 == #t~mem55;havoc #t~mem55; {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {40261#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {40261#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {40261#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); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {40261#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {40261#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {40261#false} ~skip~0 := 0; {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {40261#false} assume !false; {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {40261#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {40261#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {40261#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {40261#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {40261#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {40261#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {40261#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {40261#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {40261#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {40261#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {40261#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {40261#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {40261#false} assume 8496 == #t~mem58;havoc #t~mem58; {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {40261#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {40261#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 47: Hoare triple {40261#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 48: Hoare triple {40261#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 49: Hoare triple {40261#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 50: Hoare triple {40261#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 51: Hoare triple {40261#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 52: Hoare triple {40261#false} ~skip~0 := 0; {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 53: Hoare triple {40261#false} assume !false; {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 54: Hoare triple {40261#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 55: Hoare triple {40261#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 56: Hoare triple {40261#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 57: Hoare triple {40261#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 58: Hoare triple {40261#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 59: Hoare triple {40261#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 60: Hoare triple {40261#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 61: Hoare triple {40261#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 62: Hoare triple {40261#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,798 INFO L290 TraceCheckUtils]: 63: Hoare triple {40261#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 64: Hoare triple {40261#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 65: Hoare triple {40261#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 66: Hoare triple {40261#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 67: Hoare triple {40261#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 68: Hoare triple {40261#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {40261#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 70: Hoare triple {40261#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 71: Hoare triple {40261#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 72: Hoare triple {40261#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 73: Hoare triple {40261#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 74: Hoare triple {40261#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 75: Hoare triple {40261#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 76: Hoare triple {40261#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 77: Hoare triple {40261#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 78: Hoare triple {40261#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 79: Hoare triple {40261#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 80: Hoare triple {40261#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 81: Hoare triple {40261#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 82: Hoare triple {40261#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 83: Hoare triple {40261#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 84: Hoare triple {40261#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,799 INFO L290 TraceCheckUtils]: 85: Hoare triple {40261#false} assume 8656 == #t~mem77;havoc #t~mem77; {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 86: Hoare triple {40261#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 87: Hoare triple {40261#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 88: Hoare triple {40261#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 4; {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 89: Hoare triple {40261#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); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 90: Hoare triple {40261#false} assume !(0 == ~tmp___10~0); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 91: Hoare triple {40261#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 92: Hoare triple {40261#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 93: Hoare triple {40261#false} ~skip~0 := 0; {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 94: Hoare triple {40261#false} assume !false; {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 95: Hoare triple {40261#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 96: Hoare triple {40261#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 97: Hoare triple {40261#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 98: Hoare triple {40261#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 99: Hoare triple {40261#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 100: Hoare triple {40261#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 101: Hoare triple {40261#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 102: Hoare triple {40261#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 103: Hoare triple {40261#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 104: Hoare triple {40261#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 105: Hoare triple {40261#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 106: Hoare triple {40261#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,800 INFO L290 TraceCheckUtils]: 107: Hoare triple {40261#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 108: Hoare triple {40261#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 109: Hoare triple {40261#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 110: Hoare triple {40261#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 111: Hoare triple {40261#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 112: Hoare triple {40261#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 113: Hoare triple {40261#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 114: Hoare triple {40261#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 115: Hoare triple {40261#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 116: Hoare triple {40261#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 117: Hoare triple {40261#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 118: Hoare triple {40261#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 119: Hoare triple {40261#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 120: Hoare triple {40261#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 121: Hoare triple {40261#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 122: Hoare triple {40261#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 123: Hoare triple {40261#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 124: Hoare triple {40261#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 125: Hoare triple {40261#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 126: Hoare triple {40261#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 127: Hoare triple {40261#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 128: Hoare triple {40261#false} assume 8672 == #t~mem79;havoc #t~mem79; {40261#false} is VALID [2022-04-27 15:27:40,801 INFO L290 TraceCheckUtils]: 129: Hoare triple {40261#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {40261#false} is VALID [2022-04-27 15:27:40,802 INFO L290 TraceCheckUtils]: 130: Hoare triple {40261#false} assume 4 == ~blastFlag~0; {40261#false} is VALID [2022-04-27 15:27:40,802 INFO L290 TraceCheckUtils]: 131: Hoare triple {40261#false} assume !false; {40261#false} is VALID [2022-04-27 15:27:40,802 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:27:40,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:40,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041855060] [2022-04-27 15:27:40,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041855060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:40,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:40,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 15:27:40,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905362082] [2022-04-27 15:27:40,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:40,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 132 [2022-04-27 15:27:40,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:40,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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:40,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:40,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 15:27:40,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:40,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 15:27:40,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:27:40,858 INFO L87 Difference]: Start difference. First operand 626 states and 927 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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:43,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:27:47,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:27:49,421 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:27:51,442 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:53,462 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:55,486 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:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:56,779 INFO L93 Difference]: Finished difference Result 1245 states and 1846 transitions. [2022-04-27 15:27:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:27:56,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 132 [2022-04-27 15:27:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2022-04-27 15:27:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2022-04-27 15:27:56,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 402 transitions. [2022-04-27 15:27:57,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:57,060 INFO L225 Difference]: With dead ends: 1245 [2022-04-27 15:27:57,060 INFO L226 Difference]: Without dead ends: 626 [2022-04-27 15:27:57,061 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:57,061 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 7 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:57,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 791 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 431 Invalid, 4 Unknown, 0 Unchecked, 12.3s Time] [2022-04-27 15:27:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-04-27 15:27:57,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2022-04-27 15:27:57,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:57,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 626 states. Second operand has 626 states, 621 states have (on average 1.4847020933977455) internal successors, (922), 621 states have internal predecessors, (922), 3 states have call successors, (3), 3 states 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:57,069 INFO L74 IsIncluded]: Start isIncluded. First operand 626 states. Second operand has 626 states, 621 states have (on average 1.4847020933977455) internal successors, (922), 621 states have internal predecessors, (922), 3 states have call successors, (3), 3 states 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:57,070 INFO L87 Difference]: Start difference. First operand 626 states. Second operand has 626 states, 621 states have (on average 1.4847020933977455) internal successors, (922), 621 states have internal predecessors, (922), 3 states have call successors, (3), 3 states 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:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:57,081 INFO L93 Difference]: Finished difference Result 626 states and 926 transitions. [2022-04-27 15:27:57,081 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 926 transitions. [2022-04-27 15:27:57,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:57,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:57,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 626 states, 621 states have (on average 1.4847020933977455) internal successors, (922), 621 states have internal predecessors, (922), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 626 states. [2022-04-27 15:27:57,083 INFO L87 Difference]: Start difference. First operand has 626 states, 621 states have (on average 1.4847020933977455) internal successors, (922), 621 states have internal predecessors, (922), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 626 states. [2022-04-27 15:27:57,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:57,095 INFO L93 Difference]: Finished difference Result 626 states and 926 transitions. [2022-04-27 15:27:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 926 transitions. [2022-04-27 15:27:57,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:57,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:57,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:57,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 621 states have (on average 1.4847020933977455) internal successors, (922), 621 states have internal predecessors, (922), 3 states have call successors, (3), 3 states 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:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 926 transitions. [2022-04-27 15:27:57,110 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 926 transitions. Word has length 132 [2022-04-27 15:27:57,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:57,110 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 926 transitions. [2022-04-27 15:27:57,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 926 transitions. [2022-04-27 15:27:57,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-27 15:27:57,111 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:57,111 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:27:57,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 15:27:57,111 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:57,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:57,112 INFO L85 PathProgramCache]: Analyzing trace with hash 286813802, now seen corresponding path program 1 times [2022-04-27 15:27:57,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:57,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170364429] [2022-04-27 15:27:57,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:57,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:27:57,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 15:27:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:27:57,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 15:27:57,647 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 15:27:57,648 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:27:57,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-27 15:27:57,652 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, 1] [2022-04-27 15:27:57,654 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:27:57,760 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:27:57,760 WARN L170 areAnnotationChecker]: SSLv3_server_methodENTRY has no Hoare annotation [2022-04-27 15:27:57,760 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 15:27:57,760 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 15:27:57,760 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 15:27:57,760 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 15:27:57,760 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-27 15:27:57,760 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-27 15:27:57,760 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-27 15:27:57,760 WARN L170 areAnnotationChecker]: ssl3_acceptENTRY has no Hoare annotation [2022-04-27 15:27:57,760 WARN L170 areAnnotationChecker]: ssl3_get_server_methodENTRY has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1743 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1743 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1743-1 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1146-2 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: ssl3_get_server_methodFINAL has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1063-1 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: SSLv3_server_methodFINAL has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: L1106 has no Hoare annotation [2022-04-27 15:27:57,761 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: SSLv3_server_methodEXIT has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1065-1 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: ssl3_acceptFINAL has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: ssl3_acceptEXIT has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1723 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1727-2 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-27 15:27:57,762 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1285-2 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1654 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1692 has no Hoare annotation [2022-04-27 15:27:57,763 WARN L170 areAnnotationChecker]: L1692 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1693 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1693 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1692-1 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1694 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1694 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1694-2 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1694-2 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1705 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1705 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1373-2 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1373-2 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1383 has no Hoare annotation [2022-04-27 15:27:57,764 WARN L170 areAnnotationChecker]: L1383 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1383-2 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1392-2 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1408-2 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1454 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1454 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1430 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1416 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1416 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1455 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1455 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1432 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1432 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-27 15:27:57,765 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1456 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1456 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1419-1 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1474 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1509 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1509 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1506-1 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1477 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1477 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-27 15:27:57,766 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1533 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1533 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1556 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1556 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1258 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1567 has no Hoare annotation [2022-04-27 15:27:57,767 WARN L170 areAnnotationChecker]: L1567 has no Hoare annotation [2022-04-27 15:27:57,768 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-27 15:27:57,768 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-27 15:27:57,768 WARN L170 areAnnotationChecker]: L1572 has no Hoare annotation [2022-04-27 15:27:57,768 WARN L170 areAnnotationChecker]: L1572 has no Hoare annotation [2022-04-27 15:27:57,768 WARN L170 areAnnotationChecker]: L1264 has no Hoare annotation [2022-04-27 15:27:57,768 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-27 15:27:57,768 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-27 15:27:57,768 WARN L170 areAnnotationChecker]: L1572-2 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1582 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1582 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1589 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1589 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1270 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1592-2 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1592-2 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1592 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1592 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1616 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1616 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1620 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1620 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1273 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1276 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1636 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1636 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-27 15:27:57,769 WARN L170 areAnnotationChecker]: L1636-1 has no Hoare annotation [2022-04-27 15:27:57,769 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:57,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:27:57 BoogieIcfgContainer [2022-04-27 15:27:57,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:27:57,772 INFO L158 Benchmark]: Toolchain (without parser) took 146097.54ms. Allocated memory was 188.7MB in the beginning and 250.6MB in the end (delta: 61.9MB). Free memory was 135.4MB in the beginning and 130.9MB in the end (delta: 4.5MB). Peak memory consumption was 129.4MB. Max. memory is 8.0GB. [2022-04-27 15:27:57,773 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory was 154.5MB in the beginning and 154.3MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:27:57,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.93ms. Allocated memory is still 188.7MB. Free memory was 135.3MB in the beginning and 140.4MB in the end (delta: -5.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 15:27:57,773 INFO L158 Benchmark]: Boogie Preprocessor took 97.78ms. Allocated memory is still 188.7MB. Free memory was 140.4MB in the beginning and 130.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 15:27:57,777 INFO L158 Benchmark]: RCFGBuilder took 3069.47ms. Allocated memory was 188.7MB in the beginning and 250.6MB in the end (delta: 61.9MB). Free memory was 130.4MB in the beginning and 198.2MB in the end (delta: -67.8MB). Peak memory consumption was 75.3MB. Max. memory is 8.0GB. [2022-04-27 15:27:57,777 INFO L158 Benchmark]: TraceAbstraction took 142450.50ms. Allocated memory is still 250.6MB. Free memory was 197.7MB in the beginning and 130.9MB in the end (delta: 66.8MB). Peak memory consumption was 128.6MB. Max. memory is 8.0GB. [2022-04-27 15:27:57,779 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 188.7MB. Free memory was 154.5MB in the beginning and 154.3MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 473.93ms. Allocated memory is still 188.7MB. Free memory was 135.3MB in the beginning and 140.4MB in the end (delta: -5.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 97.78ms. Allocated memory is still 188.7MB. Free memory was 140.4MB in the beginning and 130.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 3069.47ms. Allocated memory was 188.7MB in the beginning and 250.6MB in the end (delta: 61.9MB). Free memory was 130.4MB in the beginning and 198.2MB in the end (delta: -67.8MB). Peak memory consumption was 75.3MB. Max. memory is 8.0GB. * TraceAbstraction took 142450.50ms. Allocated memory is still 250.6MB. Free memory was 197.7MB in the beginning and 130.9MB in the end (delta: 66.8MB). Peak memory consumption was 128.6MB. 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: 1733]: 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 1152. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=4294967300, \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={-4294967294:0}, SSLv3_server_data={4:0}] [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [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 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->info_callback={0:1}, skip=0, SSLv3_server_data={4:0}, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] EXPR s->cert VAL [={0:1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:1}, blastFlag=1, got_new_session=0, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967322, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->hit=6, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1383] COND TRUE s->hit [L1384] s->state = 8656 VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1388] s->init_num = 0 VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967322, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND TRUE s->state == 8656 [L1581] EXPR s->session [L1581] EXPR s->s3 [L1581] EXPR (s->s3)->tmp.new_cipher [L1581] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1582] COND FALSE !(! tmp___9) [L1588] ret = __VERIFIER_nondet_int() [L1589] COND TRUE blastFlag == 2 [L1590] blastFlag = 4 VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1598] COND FALSE !(ret <= 0) [L1603] s->state = 8672 [L1604] s->init_num = 0 VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1605] COND FALSE !(! tmp___10) VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967322, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->s3={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1266] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND TRUE blastFlag == 4 VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=0, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] [L1733] reach_error() VAL [={0:1}, blastFlag=4, got_new_session=1, init=1, ret=0, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=0, tmp___10=5, tmp___2=8, tmp___3=9, tmp___4=0, tmp___5=10, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 184 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 142.3s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 135.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 39 mSolverCounterUnknown, 1724 SdHoareTripleChecker+Valid, 97.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1724 mSDsluCounter, 11590 SdHoareTripleChecker+Invalid, 97.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7127 mSDsCounter, 672 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10485 IncrementalHoareTripleChecker+Invalid, 11196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 672 mSolverCounterUnsat, 4463 mSDtfsCounter, 10485 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=626occurred in iteration=25, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 1072 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2324 NumberOfCodeBlocks, 2324 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2166 ConstructedInterpolants, 0 QuantifiedInterpolants, 5602 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 818/818 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:57,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...