/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.10.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:42:42,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:42:42,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:42:43,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:42:43,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:42:43,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:42:43,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:42:43,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:42:43,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:42:43,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:42:43,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:42:43,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:42:43,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:42:43,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:42:43,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:42:43,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:42:43,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:42:43,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:42:43,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:42:43,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:42:43,051 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:42:43,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:42:43,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:42:43,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:42:43,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:42:43,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:42:43,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:42:43,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:42:43,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:42:43,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:42:43,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:42:43,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:42:43,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:42:43,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:42:43,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:42:43,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:42:43,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:42:43,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:42:43,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:42:43,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:42:43,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:42:43,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:42:43,066 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:42:43,074 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:42:43,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:42:43,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:42:43,076 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:42:43,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:42:43,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:42:43,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:42:43,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:42:43,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:42:43,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:42:43,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:42:43,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:42:43,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:42:43,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:42:43,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:42:43,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:42:43,077 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:42:43,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:42:43,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:42:43,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:42:43,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:42:43,078 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:42:43,078 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:42:43,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:42:43,078 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:42:43,078 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:42:43,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:42:43,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:42:43,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:42:43,309 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:42:43,310 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:42:43,311 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.10.i.cil-2.c [2022-04-08 08:42:43,368 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7fad866/ea24b7518fff45a8bd463f589ee5b2b7/FLAGa2ec9b0b9 [2022-04-08 08:42:43,810 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:42:43,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.10.i.cil-2.c [2022-04-08 08:42:43,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7fad866/ea24b7518fff45a8bd463f589ee5b2b7/FLAGa2ec9b0b9 [2022-04-08 08:42:44,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7fad866/ea24b7518fff45a8bd463f589ee5b2b7 [2022-04-08 08:42:44,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:42:44,150 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:42:44,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:42:44,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:42:44,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:42:44,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:42:44" (1/1) ... [2022-04-08 08:42:44,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ccec30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:44, skipping insertion in model container [2022-04-08 08:42:44,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:42:44" (1/1) ... [2022-04-08 08:42:44,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:42:44,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:42:44,515 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.10.i.cil-2.c[73311,73324] [2022-04-08 08:42:44,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:42:44,530 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:42:44,621 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.10.i.cil-2.c[73311,73324] [2022-04-08 08:42:44,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:42:44,643 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:42:44,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:44 WrapperNode [2022-04-08 08:42:44,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:42:44,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:42:44,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:42:44,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:42:44,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:44" (1/1) ... [2022-04-08 08:42:44,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:44" (1/1) ... [2022-04-08 08:42:44,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:44" (1/1) ... [2022-04-08 08:42:44,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:44" (1/1) ... [2022-04-08 08:42:44,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:44" (1/1) ... [2022-04-08 08:42:44,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:44" (1/1) ... [2022-04-08 08:42:44,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:44" (1/1) ... [2022-04-08 08:42:44,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:42:44,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:42:44,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:42:44,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:42:44,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:44" (1/1) ... [2022-04-08 08:42:44,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:42:44,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:42:44,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:42:44,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:42:44,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:42:44,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:42:44,818 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:42:44,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 08:42:44,818 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 08:42:44,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:42:44,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 08:42:44,818 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:42:44,819 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:42:44,819 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:42:44,819 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:42:44,819 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:42:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:42:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:42:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:42:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:42:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:42:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:42:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:42:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:42:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 08:42:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:42:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 08:42:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 08:42:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:42:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:42:44,971 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:42:44,972 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:42:45,694 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:42:46,123 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 08:42:46,123 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 08:42:46,135 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:42:46,143 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:42:46,143 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:42:46,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:42:46 BoogieIcfgContainer [2022-04-08 08:42:46,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:42:46,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:42:46,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:42:46,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:42:46,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:42:44" (1/3) ... [2022-04-08 08:42:46,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c7abdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:42:46, skipping insertion in model container [2022-04-08 08:42:46,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:44" (2/3) ... [2022-04-08 08:42:46,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c7abdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:42:46, skipping insertion in model container [2022-04-08 08:42:46,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:42:46" (3/3) ... [2022-04-08 08:42:46,152 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-2.c [2022-04-08 08:42:46,157 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:42:46,158 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:42:46,194 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:42:46,203 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:42:46,203 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:42:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 148 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 08:42:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 08:42:46,232 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:46,233 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:46,233 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:46,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:46,236 INFO L85 PathProgramCache]: Analyzing trace with hash 105535570, now seen corresponding path program 1 times [2022-04-08 08:42:46,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:46,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [880351586] [2022-04-08 08:42:46,248 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:42:46,249 INFO L85 PathProgramCache]: Analyzing trace with hash 105535570, now seen corresponding path program 2 times [2022-04-08 08:42:46,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:46,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406034416] [2022-04-08 08:42:46,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:46,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:46,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:46,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {158#true} is VALID [2022-04-08 08:42:46,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-08 08:42:46,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} #673#return; {158#true} is VALID [2022-04-08 08:42:46,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} call ULTIMATE.init(); {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:42:46,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {158#true} is VALID [2022-04-08 08:42:46,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-08 08:42:46,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} #673#return; {158#true} is VALID [2022-04-08 08:42:46,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} call #t~ret161 := main(); {158#true} is VALID [2022-04-08 08:42:46,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {158#true} is VALID [2022-04-08 08:42:46,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {158#true} is VALID [2022-04-08 08:42:46,720 INFO L272 TraceCheckUtils]: 7: Hoare triple {158#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {158#true} is VALID [2022-04-08 08:42:46,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,747 INFO L290 TraceCheckUtils]: 39: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,747 INFO L290 TraceCheckUtils]: 40: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:46,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-08 08:42:46,750 INFO L290 TraceCheckUtils]: 44: Hoare triple {164#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {159#false} is VALID [2022-04-08 08:42:46,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {159#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {159#false} is VALID [2022-04-08 08:42:46,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {159#false} assume !(4 == ~blastFlag~0); {159#false} is VALID [2022-04-08 08:42:46,753 INFO L290 TraceCheckUtils]: 47: Hoare triple {159#false} assume !false; {159#false} is VALID [2022-04-08 08:42:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:42:46,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:46,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406034416] [2022-04-08 08:42:46,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406034416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:46,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:46,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:46,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:46,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [880351586] [2022-04-08 08:42:46,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [880351586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:46,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:46,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:46,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636863233] [2022-04-08 08:42:46,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:46,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 08:42:46,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:46,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:46,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:46,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:46,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:46,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:46,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:46,847 INFO L87 Difference]: Start difference. First operand has 155 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 148 states have internal predecessors, (250), 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 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:50,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:50,520 INFO L93 Difference]: Finished difference Result 421 states and 708 transitions. [2022-04-08 08:42:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:50,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 08:42:50,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2022-04-08 08:42:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2022-04-08 08:42:50,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 708 transitions. [2022-04-08 08:42:51,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 708 edges. 708 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:51,081 INFO L225 Difference]: With dead ends: 421 [2022-04-08 08:42:51,081 INFO L226 Difference]: Without dead ends: 255 [2022-04-08 08:42:51,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:42:51,090 INFO L913 BasicCegarLoop]: 151 mSDtfsCounter, 148 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:51,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 443 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 08:42:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-04-08 08:42:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 179. [2022-04-08 08:42:51,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:51,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 255 states. Second operand has 179 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 174 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:51,145 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand has 179 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 174 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:51,145 INFO L87 Difference]: Start difference. First operand 255 states. Second operand has 179 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 174 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:51,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:51,163 INFO L93 Difference]: Finished difference Result 255 states and 387 transitions. [2022-04-08 08:42:51,163 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 387 transitions. [2022-04-08 08:42:51,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:51,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:51,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 174 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 255 states. [2022-04-08 08:42:51,178 INFO L87 Difference]: Start difference. First operand has 179 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 174 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 255 states. [2022-04-08 08:42:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:51,188 INFO L93 Difference]: Finished difference Result 255 states and 387 transitions. [2022-04-08 08:42:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 387 transitions. [2022-04-08 08:42:51,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:51,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:51,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:51,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 174 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 282 transitions. [2022-04-08 08:42:51,195 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 282 transitions. Word has length 48 [2022-04-08 08:42:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:51,195 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 282 transitions. [2022-04-08 08:42:51,196 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:51,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 179 states and 282 transitions. [2022-04-08 08:42:51,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 282 transitions. [2022-04-08 08:42:51,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 08:42:51,397 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:51,398 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:51,398 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:42:51,398 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:51,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:51,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1029867406, now seen corresponding path program 1 times [2022-04-08 08:42:51,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:51,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1365006922] [2022-04-08 08:42:51,399 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:42:51,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1029867406, now seen corresponding path program 2 times [2022-04-08 08:42:51,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:51,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94079368] [2022-04-08 08:42:51,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:51,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:51,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {1887#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1880#true} is VALID [2022-04-08 08:42:51,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {1880#true} assume true; {1880#true} is VALID [2022-04-08 08:42:51,523 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1880#true} {1880#true} #673#return; {1880#true} is VALID [2022-04-08 08:42:51,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {1880#true} call ULTIMATE.init(); {1887#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:42:51,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {1887#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1880#true} is VALID [2022-04-08 08:42:51,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {1880#true} assume true; {1880#true} is VALID [2022-04-08 08:42:51,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1880#true} {1880#true} #673#return; {1880#true} is VALID [2022-04-08 08:42:51,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {1880#true} call #t~ret161 := main(); {1880#true} is VALID [2022-04-08 08:42:51,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {1880#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1880#true} is VALID [2022-04-08 08:42:51,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {1880#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1880#true} is VALID [2022-04-08 08:42:51,525 INFO L272 TraceCheckUtils]: 7: Hoare triple {1880#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1880#true} is VALID [2022-04-08 08:42:51,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {1880#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,537 INFO L290 TraceCheckUtils]: 32: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,541 INFO L290 TraceCheckUtils]: 42: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {1886#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-08 08:42:51,546 INFO L290 TraceCheckUtils]: 45: Hoare triple {1886#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {1881#false} is VALID [2022-04-08 08:42:51,546 INFO L290 TraceCheckUtils]: 46: Hoare triple {1881#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1881#false} is VALID [2022-04-08 08:42:51,546 INFO L290 TraceCheckUtils]: 47: Hoare triple {1881#false} assume !(4 == ~blastFlag~0); {1881#false} is VALID [2022-04-08 08:42:51,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {1881#false} assume !false; {1881#false} is VALID [2022-04-08 08:42:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:42:51,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:51,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94079368] [2022-04-08 08:42:51,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94079368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:51,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:51,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:51,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:51,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1365006922] [2022-04-08 08:42:51,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1365006922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:51,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:51,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:51,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080444698] [2022-04-08 08:42:51,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:51,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 08:42:51,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:51,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:51,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:51,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:51,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:51,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:51,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:51,584 INFO L87 Difference]: Start difference. First operand 179 states and 282 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:53,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:54,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:54,820 INFO L93 Difference]: Finished difference Result 458 states and 723 transitions. [2022-04-08 08:42:54,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:54,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 08:42:54,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:54,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-08 08:42:54,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-08 08:42:54,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 577 transitions. [2022-04-08 08:42:55,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:55,240 INFO L225 Difference]: With dead ends: 458 [2022-04-08 08:42:55,240 INFO L226 Difference]: Without dead ends: 294 [2022-04-08 08:42:55,241 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:42:55,241 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 115 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:55,242 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 340 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 08:42:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-08 08:42:55,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 219. [2022-04-08 08:42:55,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:55,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 219 states, 214 states have (on average 1.644859813084112) internal successors, (352), 214 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:55,253 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 219 states, 214 states have (on average 1.644859813084112) internal successors, (352), 214 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:55,253 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 219 states, 214 states have (on average 1.644859813084112) internal successors, (352), 214 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:55,260 INFO L93 Difference]: Finished difference Result 294 states and 459 transitions. [2022-04-08 08:42:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 459 transitions. [2022-04-08 08:42:55,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:55,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:55,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 219 states, 214 states have (on average 1.644859813084112) internal successors, (352), 214 states have internal predecessors, (352), 3 states have call successors, (3), 3 states 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-08 08:42:55,261 INFO L87 Difference]: Start difference. First operand has 219 states, 214 states have (on average 1.644859813084112) internal successors, (352), 214 states have internal predecessors, (352), 3 states have call successors, (3), 3 states 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-08 08:42:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:55,267 INFO L93 Difference]: Finished difference Result 294 states and 459 transitions. [2022-04-08 08:42:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 459 transitions. [2022-04-08 08:42:55,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:55,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:55,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:55,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 214 states have (on average 1.644859813084112) internal successors, (352), 214 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 356 transitions. [2022-04-08 08:42:55,273 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 356 transitions. Word has length 49 [2022-04-08 08:42:55,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:55,273 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 356 transitions. [2022-04-08 08:42:55,274 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:55,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 219 states and 356 transitions. [2022-04-08 08:42:55,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 356 transitions. [2022-04-08 08:42:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 08:42:55,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:55,494 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:55,494 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:42:55,495 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:55,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:55,495 INFO L85 PathProgramCache]: Analyzing trace with hash -556118041, now seen corresponding path program 1 times [2022-04-08 08:42:55,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:55,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772402402] [2022-04-08 08:42:55,542 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:55,542 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:55,542 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash -556118041, now seen corresponding path program 2 times [2022-04-08 08:42:55,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:55,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247236889] [2022-04-08 08:42:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:55,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:55,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:55,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {3841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3834#true} is VALID [2022-04-08 08:42:55,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {3834#true} assume true; {3834#true} is VALID [2022-04-08 08:42:55,671 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3834#true} {3834#true} #673#return; {3834#true} is VALID [2022-04-08 08:42:55,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {3834#true} call ULTIMATE.init(); {3841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:42:55,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {3841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3834#true} is VALID [2022-04-08 08:42:55,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {3834#true} assume true; {3834#true} is VALID [2022-04-08 08:42:55,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3834#true} {3834#true} #673#return; {3834#true} is VALID [2022-04-08 08:42:55,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {3834#true} call #t~ret161 := main(); {3834#true} is VALID [2022-04-08 08:42:55,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {3834#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3834#true} is VALID [2022-04-08 08:42:55,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {3834#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3834#true} is VALID [2022-04-08 08:42:55,673 INFO L272 TraceCheckUtils]: 7: Hoare triple {3834#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3834#true} is VALID [2022-04-08 08:42:55,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {3834#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {3839#(= 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; {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {3839#(= 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; {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {3839#(= 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)))); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {3839#(= 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; {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:55,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {3839#(= 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); {3840#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-08 08:42:55,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {3840#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {3835#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {3835#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {3835#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {3835#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {3835#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {3835#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {3835#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {3835#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {3835#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {3835#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {3835#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {3835#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,683 INFO L290 TraceCheckUtils]: 37: Hoare triple {3835#false} assume 8448 == #t~mem68;havoc #t~mem68; {3835#false} is VALID [2022-04-08 08:42:55,683 INFO L290 TraceCheckUtils]: 38: Hoare triple {3835#false} assume !(~num1~0 > 0); {3835#false} is VALID [2022-04-08 08:42:55,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {3835#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {3835#false} is VALID [2022-04-08 08:42:55,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {3835#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); {3835#false} is VALID [2022-04-08 08:42:55,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {3835#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3835#false} is VALID [2022-04-08 08:42:55,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {3835#false} ~skip~0 := 0; {3835#false} is VALID [2022-04-08 08:42:55,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {3835#false} assume !false; {3835#false} is VALID [2022-04-08 08:42:55,684 INFO L290 TraceCheckUtils]: 44: Hoare triple {3835#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); {3835#false} is VALID [2022-04-08 08:42:55,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {3835#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {3835#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,685 INFO L290 TraceCheckUtils]: 47: Hoare triple {3835#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {3835#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {3835#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,685 INFO L290 TraceCheckUtils]: 50: Hoare triple {3835#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,685 INFO L290 TraceCheckUtils]: 51: Hoare triple {3835#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {3835#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,685 INFO L290 TraceCheckUtils]: 53: Hoare triple {3835#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,685 INFO L290 TraceCheckUtils]: 54: Hoare triple {3835#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,686 INFO L290 TraceCheckUtils]: 55: Hoare triple {3835#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,686 INFO L290 TraceCheckUtils]: 56: Hoare triple {3835#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,686 INFO L290 TraceCheckUtils]: 57: Hoare triple {3835#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,686 INFO L290 TraceCheckUtils]: 58: Hoare triple {3835#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,686 INFO L290 TraceCheckUtils]: 59: Hoare triple {3835#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {3835#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {3835#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {3835#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,687 INFO L290 TraceCheckUtils]: 63: Hoare triple {3835#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,687 INFO L290 TraceCheckUtils]: 64: Hoare triple {3835#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,687 INFO L290 TraceCheckUtils]: 65: Hoare triple {3835#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,687 INFO L290 TraceCheckUtils]: 66: Hoare triple {3835#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,687 INFO L290 TraceCheckUtils]: 67: Hoare triple {3835#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,687 INFO L290 TraceCheckUtils]: 68: Hoare triple {3835#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,687 INFO L290 TraceCheckUtils]: 69: Hoare triple {3835#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,687 INFO L290 TraceCheckUtils]: 70: Hoare triple {3835#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,688 INFO L290 TraceCheckUtils]: 71: Hoare triple {3835#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,688 INFO L290 TraceCheckUtils]: 72: Hoare triple {3835#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-08 08:42:55,688 INFO L290 TraceCheckUtils]: 73: Hoare triple {3835#false} assume 8640 == #t~mem75;havoc #t~mem75; {3835#false} is VALID [2022-04-08 08:42:55,688 INFO L290 TraceCheckUtils]: 74: Hoare triple {3835#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3835#false} is VALID [2022-04-08 08:42:55,688 INFO L290 TraceCheckUtils]: 75: Hoare triple {3835#false} assume !(4 == ~blastFlag~0); {3835#false} is VALID [2022-04-08 08:42:55,688 INFO L290 TraceCheckUtils]: 76: Hoare triple {3835#false} assume !false; {3835#false} is VALID [2022-04-08 08:42:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 08:42:55,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:55,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247236889] [2022-04-08 08:42:55,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247236889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:55,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:55,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:55,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:55,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772402402] [2022-04-08 08:42:55,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772402402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:55,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:55,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:55,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885257642] [2022-04-08 08:42:55,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:55,692 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 77 [2022-04-08 08:42:55,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:55,693 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-08 08:42:55,733 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-08 08:42:55,733 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:55,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:55,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:55,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:55,734 INFO L87 Difference]: Start difference. First operand 219 states and 356 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-08 08:43:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:03,777 INFO L93 Difference]: Finished difference Result 451 states and 734 transitions. [2022-04-08 08:43:03,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:03,777 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 77 [2022-04-08 08:43:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:03,778 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-08 08:43:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 08:43:03,781 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-08 08:43:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 08:43:03,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-08 08:43:04,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:04,052 INFO L225 Difference]: With dead ends: 451 [2022-04-08 08:43:04,052 INFO L226 Difference]: Without dead ends: 247 [2022-04-08 08:43:04,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:04,054 INFO L913 BasicCegarLoop]: 180 mSDtfsCounter, 22 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:04,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 463 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 08:43:04,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-08 08:43:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 230. [2022-04-08 08:43:04,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:04,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 230 states, 225 states have (on average 1.6488888888888888) internal successors, (371), 225 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:04,065 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 230 states, 225 states have (on average 1.6488888888888888) internal successors, (371), 225 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:04,066 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 230 states, 225 states have (on average 1.6488888888888888) internal successors, (371), 225 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:04,070 INFO L93 Difference]: Finished difference Result 247 states and 396 transitions. [2022-04-08 08:43:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 396 transitions. [2022-04-08 08:43:04,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:04,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:04,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 225 states have (on average 1.6488888888888888) internal successors, (371), 225 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 247 states. [2022-04-08 08:43:04,071 INFO L87 Difference]: Start difference. First operand has 230 states, 225 states have (on average 1.6488888888888888) internal successors, (371), 225 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 247 states. [2022-04-08 08:43:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:04,076 INFO L93 Difference]: Finished difference Result 247 states and 396 transitions. [2022-04-08 08:43:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 396 transitions. [2022-04-08 08:43:04,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:04,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:04,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:04,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 225 states have (on average 1.6488888888888888) internal successors, (371), 225 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 375 transitions. [2022-04-08 08:43:04,082 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 375 transitions. Word has length 77 [2022-04-08 08:43:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:04,082 INFO L478 AbstractCegarLoop]: Abstraction has 230 states and 375 transitions. [2022-04-08 08:43:04,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:04,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 230 states and 375 transitions. [2022-04-08 08:43:04,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 375 edges. 375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:04,361 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 375 transitions. [2022-04-08 08:43:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-08 08:43:04,362 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:04,362 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:04,362 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:43:04,362 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:04,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:04,362 INFO L85 PathProgramCache]: Analyzing trace with hash -847556179, now seen corresponding path program 1 times [2022-04-08 08:43:04,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:04,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [835941018] [2022-04-08 08:43:04,406 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:04,406 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:04,406 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:04,406 INFO L85 PathProgramCache]: Analyzing trace with hash -847556179, now seen corresponding path program 2 times [2022-04-08 08:43:04,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:04,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014502373] [2022-04-08 08:43:04,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:04,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:04,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:04,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {5709#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5702#true} is VALID [2022-04-08 08:43:04,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {5702#true} assume true; {5702#true} is VALID [2022-04-08 08:43:04,572 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5702#true} {5702#true} #673#return; {5702#true} is VALID [2022-04-08 08:43:04,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {5702#true} call ULTIMATE.init(); {5709#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:43:04,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {5709#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5702#true} is VALID [2022-04-08 08:43:04,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {5702#true} assume true; {5702#true} is VALID [2022-04-08 08:43:04,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5702#true} {5702#true} #673#return; {5702#true} is VALID [2022-04-08 08:43:04,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {5702#true} call #t~ret161 := main(); {5702#true} is VALID [2022-04-08 08:43:04,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {5702#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5702#true} is VALID [2022-04-08 08:43:04,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {5702#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5702#true} is VALID [2022-04-08 08:43:04,573 INFO L272 TraceCheckUtils]: 7: Hoare triple {5702#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5702#true} is VALID [2022-04-08 08:43:04,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {5702#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:04,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {5707#(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; {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:04,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {5707#(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; {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:04,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {5707#(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)))); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:04,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {5707#(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); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:04,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {5707#(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; {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:04,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:04,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {5707#(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); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:04,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {5707#(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); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:04,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {5707#(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); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:04,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {5707#(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); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:04,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {5707#(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); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:04,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {5707#(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); {5708#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-08 08:43:04,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {5708#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {5703#false} is VALID [2022-04-08 08:43:04,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {5703#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; {5703#false} is VALID [2022-04-08 08:43:04,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {5703#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); {5703#false} is VALID [2022-04-08 08:43:04,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {5703#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); {5703#false} is VALID [2022-04-08 08:43:04,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {5703#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5703#false} is VALID [2022-04-08 08:43:04,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {5703#false} ~skip~0 := 0; {5703#false} is VALID [2022-04-08 08:43:04,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {5703#false} assume !false; {5703#false} is VALID [2022-04-08 08:43:04,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {5703#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); {5703#false} is VALID [2022-04-08 08:43:04,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {5703#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {5703#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {5703#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {5703#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {5703#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {5703#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {5703#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {5703#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {5703#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {5703#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {5703#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {5703#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,586 INFO L290 TraceCheckUtils]: 41: Hoare triple {5703#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {5703#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {5703#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {5703#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,586 INFO L290 TraceCheckUtils]: 45: Hoare triple {5703#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {5703#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {5703#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {5703#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,587 INFO L290 TraceCheckUtils]: 49: Hoare triple {5703#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {5703#false} assume 8448 == #t~mem68;havoc #t~mem68; {5703#false} is VALID [2022-04-08 08:43:04,587 INFO L290 TraceCheckUtils]: 51: Hoare triple {5703#false} assume !(~num1~0 > 0); {5703#false} is VALID [2022-04-08 08:43:04,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {5703#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {5703#false} is VALID [2022-04-08 08:43:04,587 INFO L290 TraceCheckUtils]: 53: Hoare triple {5703#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); {5703#false} is VALID [2022-04-08 08:43:04,587 INFO L290 TraceCheckUtils]: 54: Hoare triple {5703#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5703#false} is VALID [2022-04-08 08:43:04,587 INFO L290 TraceCheckUtils]: 55: Hoare triple {5703#false} ~skip~0 := 0; {5703#false} is VALID [2022-04-08 08:43:04,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {5703#false} assume !false; {5703#false} is VALID [2022-04-08 08:43:04,588 INFO L290 TraceCheckUtils]: 57: Hoare triple {5703#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); {5703#false} is VALID [2022-04-08 08:43:04,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {5703#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,588 INFO L290 TraceCheckUtils]: 59: Hoare triple {5703#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,591 INFO L290 TraceCheckUtils]: 60: Hoare triple {5703#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,592 INFO L290 TraceCheckUtils]: 61: Hoare triple {5703#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,595 INFO L290 TraceCheckUtils]: 62: Hoare triple {5703#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,595 INFO L290 TraceCheckUtils]: 63: Hoare triple {5703#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,595 INFO L290 TraceCheckUtils]: 64: Hoare triple {5703#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,595 INFO L290 TraceCheckUtils]: 65: Hoare triple {5703#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,595 INFO L290 TraceCheckUtils]: 66: Hoare triple {5703#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {5703#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,596 INFO L290 TraceCheckUtils]: 68: Hoare triple {5703#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,596 INFO L290 TraceCheckUtils]: 69: Hoare triple {5703#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,596 INFO L290 TraceCheckUtils]: 70: Hoare triple {5703#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,596 INFO L290 TraceCheckUtils]: 71: Hoare triple {5703#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,596 INFO L290 TraceCheckUtils]: 72: Hoare triple {5703#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,596 INFO L290 TraceCheckUtils]: 73: Hoare triple {5703#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,596 INFO L290 TraceCheckUtils]: 74: Hoare triple {5703#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,596 INFO L290 TraceCheckUtils]: 75: Hoare triple {5703#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,596 INFO L290 TraceCheckUtils]: 76: Hoare triple {5703#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,596 INFO L290 TraceCheckUtils]: 77: Hoare triple {5703#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,596 INFO L290 TraceCheckUtils]: 78: Hoare triple {5703#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,597 INFO L290 TraceCheckUtils]: 79: Hoare triple {5703#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,597 INFO L290 TraceCheckUtils]: 80: Hoare triple {5703#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,597 INFO L290 TraceCheckUtils]: 81: Hoare triple {5703#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,597 INFO L290 TraceCheckUtils]: 82: Hoare triple {5703#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,597 INFO L290 TraceCheckUtils]: 83: Hoare triple {5703#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,597 INFO L290 TraceCheckUtils]: 84: Hoare triple {5703#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,597 INFO L290 TraceCheckUtils]: 85: Hoare triple {5703#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-08 08:43:04,597 INFO L290 TraceCheckUtils]: 86: Hoare triple {5703#false} assume 8640 == #t~mem75;havoc #t~mem75; {5703#false} is VALID [2022-04-08 08:43:04,597 INFO L290 TraceCheckUtils]: 87: Hoare triple {5703#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5703#false} is VALID [2022-04-08 08:43:04,597 INFO L290 TraceCheckUtils]: 88: Hoare triple {5703#false} assume !(4 == ~blastFlag~0); {5703#false} is VALID [2022-04-08 08:43:04,597 INFO L290 TraceCheckUtils]: 89: Hoare triple {5703#false} assume !false; {5703#false} is VALID [2022-04-08 08:43:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:43:04,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:04,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014502373] [2022-04-08 08:43:04,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014502373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:04,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:04,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:04,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:04,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [835941018] [2022-04-08 08:43:04,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [835941018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:04,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:04,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:04,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505470356] [2022-04-08 08:43:04,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:04,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-08 08:43:04,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:04,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:04,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:04,642 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:04,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:04,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:04,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:04,642 INFO L87 Difference]: Start difference. First operand 230 states and 375 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:07,799 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-08 08:43:11,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:13,644 INFO L93 Difference]: Finished difference Result 549 states and 888 transitions. [2022-04-08 08:43:13,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:13,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-08 08:43:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-08 08:43:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-08 08:43:13,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-08 08:43:14,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:14,030 INFO L225 Difference]: With dead ends: 549 [2022-04-08 08:43:14,031 INFO L226 Difference]: Without dead ends: 345 [2022-04-08 08:43:14,031 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:14,032 INFO L913 BasicCegarLoop]: 248 mSDtfsCounter, 138 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:14,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 598 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 610 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-04-08 08:43:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-08 08:43:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 246. [2022-04-08 08:43:14,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:14,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 246 states, 241 states have (on average 1.6390041493775933) internal successors, (395), 241 states have internal predecessors, (395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:14,048 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 246 states, 241 states have (on average 1.6390041493775933) internal successors, (395), 241 states have internal predecessors, (395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:14,049 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 246 states, 241 states have (on average 1.6390041493775933) internal successors, (395), 241 states have internal predecessors, (395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:14,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:14,054 INFO L93 Difference]: Finished difference Result 345 states and 548 transitions. [2022-04-08 08:43:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 548 transitions. [2022-04-08 08:43:14,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:14,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:14,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.6390041493775933) internal successors, (395), 241 states have internal predecessors, (395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-08 08:43:14,056 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.6390041493775933) internal successors, (395), 241 states have internal predecessors, (395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-08 08:43:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:14,062 INFO L93 Difference]: Finished difference Result 345 states and 548 transitions. [2022-04-08 08:43:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 548 transitions. [2022-04-08 08:43:14,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:14,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:14,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:14,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.6390041493775933) internal successors, (395), 241 states have internal predecessors, (395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 399 transitions. [2022-04-08 08:43:14,067 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 399 transitions. Word has length 90 [2022-04-08 08:43:14,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:14,067 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 399 transitions. [2022-04-08 08:43:14,067 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:14,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 399 transitions. [2022-04-08 08:43:14,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 399 edges. 399 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 399 transitions. [2022-04-08 08:43:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 08:43:14,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:14,340 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:14,340 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:43:14,340 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1839246915, now seen corresponding path program 1 times [2022-04-08 08:43:14,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:14,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1574218869] [2022-04-08 08:43:14,398 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:14,399 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:14,399 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1839246915, now seen corresponding path program 2 times [2022-04-08 08:43:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:14,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767709404] [2022-04-08 08:43:14,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:14,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:14,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:14,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {8001#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7994#true} is VALID [2022-04-08 08:43:14,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {7994#true} assume true; {7994#true} is VALID [2022-04-08 08:43:14,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7994#true} {7994#true} #673#return; {7994#true} is VALID [2022-04-08 08:43:14,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {7994#true} call ULTIMATE.init(); {8001#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:43:14,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {8001#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7994#true} is VALID [2022-04-08 08:43:14,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {7994#true} assume true; {7994#true} is VALID [2022-04-08 08:43:14,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7994#true} {7994#true} #673#return; {7994#true} is VALID [2022-04-08 08:43:14,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {7994#true} call #t~ret161 := main(); {7994#true} is VALID [2022-04-08 08:43:14,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {7994#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7994#true} is VALID [2022-04-08 08:43:14,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {7994#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {7994#true} is VALID [2022-04-08 08:43:14,542 INFO L272 TraceCheckUtils]: 7: Hoare triple {7994#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7994#true} is VALID [2022-04-08 08:43:14,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {7994#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:14,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {7999#(= 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; {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:14,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {7999#(= 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; {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:14,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {7999#(= 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)))); {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:14,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {7999#(= 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); {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:14,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {7999#(= 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; {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:14,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:14,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {7999#(= 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); {8000#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-08 08:43:14,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {8000#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {7995#false} is VALID [2022-04-08 08:43:14,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {7995#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {7995#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {7995#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7995#false} is VALID [2022-04-08 08:43:14,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {7995#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {7995#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); {7995#false} is VALID [2022-04-08 08:43:14,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {7995#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {7995#false} is VALID [2022-04-08 08:43:14,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {7995#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); {7995#false} is VALID [2022-04-08 08:43:14,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {7995#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); {7995#false} is VALID [2022-04-08 08:43:14,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {7995#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); {7995#false} is VALID [2022-04-08 08:43:14,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {7995#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7995#false} is VALID [2022-04-08 08:43:14,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {7995#false} ~skip~0 := 0; {7995#false} is VALID [2022-04-08 08:43:14,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {7995#false} assume !false; {7995#false} is VALID [2022-04-08 08:43:14,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {7995#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); {7995#false} is VALID [2022-04-08 08:43:14,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {7995#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {7995#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {7995#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {7995#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {7995#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {7995#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {7995#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {7995#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {7995#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {7995#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {7995#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {7995#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {7995#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {7995#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {7995#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {7995#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {7995#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {7995#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {7995#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {7995#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,551 INFO L290 TraceCheckUtils]: 50: Hoare triple {7995#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,551 INFO L290 TraceCheckUtils]: 51: Hoare triple {7995#false} assume 8448 == #t~mem68;havoc #t~mem68; {7995#false} is VALID [2022-04-08 08:43:14,552 INFO L290 TraceCheckUtils]: 52: Hoare triple {7995#false} assume !(~num1~0 > 0); {7995#false} is VALID [2022-04-08 08:43:14,552 INFO L290 TraceCheckUtils]: 53: Hoare triple {7995#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {7995#false} is VALID [2022-04-08 08:43:14,552 INFO L290 TraceCheckUtils]: 54: Hoare triple {7995#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); {7995#false} is VALID [2022-04-08 08:43:14,552 INFO L290 TraceCheckUtils]: 55: Hoare triple {7995#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7995#false} is VALID [2022-04-08 08:43:14,552 INFO L290 TraceCheckUtils]: 56: Hoare triple {7995#false} ~skip~0 := 0; {7995#false} is VALID [2022-04-08 08:43:14,552 INFO L290 TraceCheckUtils]: 57: Hoare triple {7995#false} assume !false; {7995#false} is VALID [2022-04-08 08:43:14,552 INFO L290 TraceCheckUtils]: 58: Hoare triple {7995#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); {7995#false} is VALID [2022-04-08 08:43:14,552 INFO L290 TraceCheckUtils]: 59: Hoare triple {7995#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,552 INFO L290 TraceCheckUtils]: 60: Hoare triple {7995#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {7995#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {7995#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {7995#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,552 INFO L290 TraceCheckUtils]: 64: Hoare triple {7995#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,553 INFO L290 TraceCheckUtils]: 65: Hoare triple {7995#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,553 INFO L290 TraceCheckUtils]: 66: Hoare triple {7995#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,553 INFO L290 TraceCheckUtils]: 67: Hoare triple {7995#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,553 INFO L290 TraceCheckUtils]: 68: Hoare triple {7995#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,553 INFO L290 TraceCheckUtils]: 69: Hoare triple {7995#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,553 INFO L290 TraceCheckUtils]: 70: Hoare triple {7995#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,553 INFO L290 TraceCheckUtils]: 71: Hoare triple {7995#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {7995#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {7995#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,553 INFO L290 TraceCheckUtils]: 74: Hoare triple {7995#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,553 INFO L290 TraceCheckUtils]: 75: Hoare triple {7995#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,553 INFO L290 TraceCheckUtils]: 76: Hoare triple {7995#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,554 INFO L290 TraceCheckUtils]: 77: Hoare triple {7995#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,554 INFO L290 TraceCheckUtils]: 78: Hoare triple {7995#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,554 INFO L290 TraceCheckUtils]: 79: Hoare triple {7995#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,554 INFO L290 TraceCheckUtils]: 80: Hoare triple {7995#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,554 INFO L290 TraceCheckUtils]: 81: Hoare triple {7995#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,554 INFO L290 TraceCheckUtils]: 82: Hoare triple {7995#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,554 INFO L290 TraceCheckUtils]: 83: Hoare triple {7995#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,554 INFO L290 TraceCheckUtils]: 84: Hoare triple {7995#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,554 INFO L290 TraceCheckUtils]: 85: Hoare triple {7995#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,554 INFO L290 TraceCheckUtils]: 86: Hoare triple {7995#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-08 08:43:14,554 INFO L290 TraceCheckUtils]: 87: Hoare triple {7995#false} assume 8640 == #t~mem75;havoc #t~mem75; {7995#false} is VALID [2022-04-08 08:43:14,554 INFO L290 TraceCheckUtils]: 88: Hoare triple {7995#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {7995#false} is VALID [2022-04-08 08:43:14,554 INFO L290 TraceCheckUtils]: 89: Hoare triple {7995#false} assume !(4 == ~blastFlag~0); {7995#false} is VALID [2022-04-08 08:43:14,555 INFO L290 TraceCheckUtils]: 90: Hoare triple {7995#false} assume !false; {7995#false} is VALID [2022-04-08 08:43:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:43:14,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:14,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767709404] [2022-04-08 08:43:14,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767709404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:14,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:14,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:14,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:14,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1574218869] [2022-04-08 08:43:14,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1574218869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:14,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:14,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:14,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373879374] [2022-04-08 08:43:14,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:14,557 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 91 [2022-04-08 08:43:14,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:14,559 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-08 08:43:14,600 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-08 08:43:14,600 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:14,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:14,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:14,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:14,601 INFO L87 Difference]: Start difference. First operand 246 states and 399 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-08 08:43:16,623 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-08 08:43:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:17,561 INFO L93 Difference]: Finished difference Result 482 states and 781 transitions. [2022-04-08 08:43:17,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:17,562 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 91 [2022-04-08 08:43:17,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:17,562 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-08 08:43:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-08 08:43:17,564 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-08 08:43:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-08 08:43:17,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 437 transitions. [2022-04-08 08:43:17,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:17,845 INFO L225 Difference]: With dead ends: 482 [2022-04-08 08:43:17,845 INFO L226 Difference]: Without dead ends: 262 [2022-04-08 08:43:17,847 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:17,848 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 28 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:17,848 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 467 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:43:17,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-08 08:43:17,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 246. [2022-04-08 08:43:17,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:17,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 246 states, 241 states have (on average 1.6348547717842323) internal successors, (394), 241 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:17,859 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 246 states, 241 states have (on average 1.6348547717842323) internal successors, (394), 241 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:17,860 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 246 states, 241 states have (on average 1.6348547717842323) internal successors, (394), 241 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:17,864 INFO L93 Difference]: Finished difference Result 262 states and 418 transitions. [2022-04-08 08:43:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 418 transitions. [2022-04-08 08:43:17,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:17,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:17,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.6348547717842323) internal successors, (394), 241 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-08 08:43:17,865 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.6348547717842323) internal successors, (394), 241 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-08 08:43:17,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:17,869 INFO L93 Difference]: Finished difference Result 262 states and 418 transitions. [2022-04-08 08:43:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 418 transitions. [2022-04-08 08:43:17,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:17,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:17,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:17,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.6348547717842323) internal successors, (394), 241 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 398 transitions. [2022-04-08 08:43:17,877 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 398 transitions. Word has length 91 [2022-04-08 08:43:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:17,877 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 398 transitions. [2022-04-08 08:43:17,877 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:17,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 398 transitions. [2022-04-08 08:43:18,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 398 transitions. [2022-04-08 08:43:18,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 08:43:18,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:18,153 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:18,153 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:43:18,153 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:18,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1790326953, now seen corresponding path program 1 times [2022-04-08 08:43:18,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:18,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [819618640] [2022-04-08 08:43:18,192 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:18,193 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:18,193 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:18,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1790326953, now seen corresponding path program 2 times [2022-04-08 08:43:18,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:18,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213279489] [2022-04-08 08:43:18,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:18,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:18,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:18,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {9993#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9986#true} is VALID [2022-04-08 08:43:18,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 08:43:18,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9986#true} {9986#true} #673#return; {9986#true} is VALID [2022-04-08 08:43:18,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {9986#true} call ULTIMATE.init(); {9993#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:43:18,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {9993#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9986#true} is VALID [2022-04-08 08:43:18,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 08:43:18,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9986#true} {9986#true} #673#return; {9986#true} is VALID [2022-04-08 08:43:18,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {9986#true} call #t~ret161 := main(); {9986#true} is VALID [2022-04-08 08:43:18,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {9986#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9986#true} is VALID [2022-04-08 08:43:18,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {9986#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9986#true} is VALID [2022-04-08 08:43:18,362 INFO L272 TraceCheckUtils]: 7: Hoare triple {9986#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9986#true} is VALID [2022-04-08 08:43:18,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {9986#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:18,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:18,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:18,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:18,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:18,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:18,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:18,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {9991#(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); {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:18,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {9991#(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); {9992#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-08 08:43:18,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {9992#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {9987#false} is VALID [2022-04-08 08:43:18,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {9987#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {9987#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9987#false} is VALID [2022-04-08 08:43:18,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {9987#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {9987#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); {9987#false} is VALID [2022-04-08 08:43:18,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {9987#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {9987#false} is VALID [2022-04-08 08:43:18,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {9987#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); {9987#false} is VALID [2022-04-08 08:43:18,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {9987#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); {9987#false} is VALID [2022-04-08 08:43:18,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {9987#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); {9987#false} is VALID [2022-04-08 08:43:18,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {9987#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9987#false} is VALID [2022-04-08 08:43:18,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {9987#false} ~skip~0 := 0; {9987#false} is VALID [2022-04-08 08:43:18,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2022-04-08 08:43:18,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {9987#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); {9987#false} is VALID [2022-04-08 08:43:18,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {9987#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {9987#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {9987#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {9987#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {9987#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {9987#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {9987#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {9987#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {9987#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {9987#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {9987#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {9987#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {9987#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {9987#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {9987#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {9987#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,373 INFO L290 TraceCheckUtils]: 46: Hoare triple {9987#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,373 INFO L290 TraceCheckUtils]: 47: Hoare triple {9987#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {9987#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,373 INFO L290 TraceCheckUtils]: 49: Hoare triple {9987#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,373 INFO L290 TraceCheckUtils]: 50: Hoare triple {9987#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,373 INFO L290 TraceCheckUtils]: 51: Hoare triple {9987#false} assume 8448 == #t~mem68;havoc #t~mem68; {9987#false} is VALID [2022-04-08 08:43:18,373 INFO L290 TraceCheckUtils]: 52: Hoare triple {9987#false} assume !(~num1~0 > 0); {9987#false} is VALID [2022-04-08 08:43:18,373 INFO L290 TraceCheckUtils]: 53: Hoare triple {9987#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {9987#false} is VALID [2022-04-08 08:43:18,373 INFO L290 TraceCheckUtils]: 54: Hoare triple {9987#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); {9987#false} is VALID [2022-04-08 08:43:18,373 INFO L290 TraceCheckUtils]: 55: Hoare triple {9987#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9987#false} is VALID [2022-04-08 08:43:18,373 INFO L290 TraceCheckUtils]: 56: Hoare triple {9987#false} ~skip~0 := 0; {9987#false} is VALID [2022-04-08 08:43:18,374 INFO L290 TraceCheckUtils]: 57: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2022-04-08 08:43:18,374 INFO L290 TraceCheckUtils]: 58: Hoare triple {9987#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); {9987#false} is VALID [2022-04-08 08:43:18,374 INFO L290 TraceCheckUtils]: 59: Hoare triple {9987#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,374 INFO L290 TraceCheckUtils]: 60: Hoare triple {9987#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,374 INFO L290 TraceCheckUtils]: 61: Hoare triple {9987#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,374 INFO L290 TraceCheckUtils]: 62: Hoare triple {9987#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,374 INFO L290 TraceCheckUtils]: 63: Hoare triple {9987#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,374 INFO L290 TraceCheckUtils]: 64: Hoare triple {9987#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,374 INFO L290 TraceCheckUtils]: 65: Hoare triple {9987#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,374 INFO L290 TraceCheckUtils]: 66: Hoare triple {9987#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,374 INFO L290 TraceCheckUtils]: 67: Hoare triple {9987#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,374 INFO L290 TraceCheckUtils]: 68: Hoare triple {9987#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,374 INFO L290 TraceCheckUtils]: 69: Hoare triple {9987#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,375 INFO L290 TraceCheckUtils]: 70: Hoare triple {9987#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,375 INFO L290 TraceCheckUtils]: 71: Hoare triple {9987#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,375 INFO L290 TraceCheckUtils]: 72: Hoare triple {9987#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,375 INFO L290 TraceCheckUtils]: 73: Hoare triple {9987#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,375 INFO L290 TraceCheckUtils]: 74: Hoare triple {9987#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,375 INFO L290 TraceCheckUtils]: 75: Hoare triple {9987#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,375 INFO L290 TraceCheckUtils]: 76: Hoare triple {9987#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,375 INFO L290 TraceCheckUtils]: 77: Hoare triple {9987#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,375 INFO L290 TraceCheckUtils]: 78: Hoare triple {9987#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,375 INFO L290 TraceCheckUtils]: 79: Hoare triple {9987#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,375 INFO L290 TraceCheckUtils]: 80: Hoare triple {9987#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,375 INFO L290 TraceCheckUtils]: 81: Hoare triple {9987#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,375 INFO L290 TraceCheckUtils]: 82: Hoare triple {9987#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,375 INFO L290 TraceCheckUtils]: 83: Hoare triple {9987#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,376 INFO L290 TraceCheckUtils]: 84: Hoare triple {9987#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,376 INFO L290 TraceCheckUtils]: 85: Hoare triple {9987#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,376 INFO L290 TraceCheckUtils]: 86: Hoare triple {9987#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-08 08:43:18,376 INFO L290 TraceCheckUtils]: 87: Hoare triple {9987#false} assume 8640 == #t~mem75;havoc #t~mem75; {9987#false} is VALID [2022-04-08 08:43:18,376 INFO L290 TraceCheckUtils]: 88: Hoare triple {9987#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9987#false} is VALID [2022-04-08 08:43:18,376 INFO L290 TraceCheckUtils]: 89: Hoare triple {9987#false} assume !(4 == ~blastFlag~0); {9987#false} is VALID [2022-04-08 08:43:18,376 INFO L290 TraceCheckUtils]: 90: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2022-04-08 08:43:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:43:18,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:18,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213279489] [2022-04-08 08:43:18,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213279489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:18,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:18,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:18,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:18,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [819618640] [2022-04-08 08:43:18,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [819618640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:18,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:18,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:18,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344694458] [2022-04-08 08:43:18,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:18,380 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 91 [2022-04-08 08:43:18,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:18,380 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-08 08:43:18,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:18,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:18,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:18,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:18,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:18,424 INFO L87 Difference]: Start difference. First operand 246 states and 398 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-08 08:43:23,827 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:26,882 INFO L93 Difference]: Finished difference Result 541 states and 863 transitions. [2022-04-08 08:43:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:26,882 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 91 [2022-04-08 08:43:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:26,883 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-08 08:43:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-08 08:43:26,886 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-08 08:43:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-08 08:43:26,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-08 08:43:27,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:27,317 INFO L225 Difference]: With dead ends: 541 [2022-04-08 08:43:27,317 INFO L226 Difference]: Without dead ends: 321 [2022-04-08 08:43:27,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:27,319 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 142 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:27,320 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 340 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-08 08:43:27,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-08 08:43:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 246. [2022-04-08 08:43:27,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:27,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 246 states, 241 states have (on average 1.6182572614107884) internal successors, (390), 241 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:27,332 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 246 states, 241 states have (on average 1.6182572614107884) internal successors, (390), 241 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:27,332 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 246 states, 241 states have (on average 1.6182572614107884) internal successors, (390), 241 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:27,337 INFO L93 Difference]: Finished difference Result 321 states and 497 transitions. [2022-04-08 08:43:27,337 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 497 transitions. [2022-04-08 08:43:27,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:27,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:27,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.6182572614107884) internal successors, (390), 241 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-08 08:43:27,339 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.6182572614107884) internal successors, (390), 241 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-08 08:43:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:27,344 INFO L93 Difference]: Finished difference Result 321 states and 497 transitions. [2022-04-08 08:43:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 497 transitions. [2022-04-08 08:43:27,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:27,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:27,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:27,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:27,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.6182572614107884) internal successors, (390), 241 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 394 transitions. [2022-04-08 08:43:27,349 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 394 transitions. Word has length 91 [2022-04-08 08:43:27,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:27,350 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 394 transitions. [2022-04-08 08:43:27,350 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:27,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 394 transitions. [2022-04-08 08:43:27,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 394 edges. 394 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:27,617 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 394 transitions. [2022-04-08 08:43:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 08:43:27,618 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:27,618 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:27,618 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:43:27,618 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:27,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1810194734, now seen corresponding path program 1 times [2022-04-08 08:43:27,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:27,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [806062347] [2022-04-08 08:43:27,675 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:27,675 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:27,675 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:27,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1810194734, now seen corresponding path program 2 times [2022-04-08 08:43:27,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:27,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403118199] [2022-04-08 08:43:27,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:27,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:27,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:27,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {12221#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12214#true} is VALID [2022-04-08 08:43:27,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {12214#true} assume true; {12214#true} is VALID [2022-04-08 08:43:27,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12214#true} {12214#true} #673#return; {12214#true} is VALID [2022-04-08 08:43:27,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {12214#true} call ULTIMATE.init(); {12221#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:43:27,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {12221#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12214#true} is VALID [2022-04-08 08:43:27,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {12214#true} assume true; {12214#true} is VALID [2022-04-08 08:43:27,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12214#true} {12214#true} #673#return; {12214#true} is VALID [2022-04-08 08:43:27,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {12214#true} call #t~ret161 := main(); {12214#true} is VALID [2022-04-08 08:43:27,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {12214#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12214#true} is VALID [2022-04-08 08:43:27,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {12214#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12214#true} is VALID [2022-04-08 08:43:27,789 INFO L272 TraceCheckUtils]: 7: Hoare triple {12214#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12214#true} is VALID [2022-04-08 08:43:27,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {12214#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:27,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {12219#(= 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; {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:27,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {12219#(= 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; {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:27,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {12219#(= 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)))); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:27,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {12219#(= 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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:27,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {12219#(= 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; {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:27,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:27,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {12219#(= 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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:27,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {12219#(= 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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:27,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {12219#(= 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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:27,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {12219#(= 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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:27,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {12219#(= 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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:27,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {12219#(= 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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:27,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {12219#(= 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); {12220#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-08 08:43:27,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {12220#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {12215#false} is VALID [2022-04-08 08:43:27,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {12215#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; {12215#false} is VALID [2022-04-08 08:43:27,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {12215#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); {12215#false} is VALID [2022-04-08 08:43:27,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {12215#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); {12215#false} is VALID [2022-04-08 08:43:27,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {12215#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12215#false} is VALID [2022-04-08 08:43:27,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {12215#false} ~skip~0 := 0; {12215#false} is VALID [2022-04-08 08:43:27,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {12215#false} assume !false; {12215#false} is VALID [2022-04-08 08:43:27,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {12215#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); {12215#false} is VALID [2022-04-08 08:43:27,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {12215#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {12215#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {12215#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {12215#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {12215#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {12215#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {12215#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {12215#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {12215#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {12215#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {12215#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {12215#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {12215#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,797 INFO L290 TraceCheckUtils]: 43: Hoare triple {12215#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,797 INFO L290 TraceCheckUtils]: 44: Hoare triple {12215#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {12215#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,797 INFO L290 TraceCheckUtils]: 46: Hoare triple {12215#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,798 INFO L290 TraceCheckUtils]: 47: Hoare triple {12215#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,798 INFO L290 TraceCheckUtils]: 48: Hoare triple {12215#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,798 INFO L290 TraceCheckUtils]: 49: Hoare triple {12215#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,798 INFO L290 TraceCheckUtils]: 50: Hoare triple {12215#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,798 INFO L290 TraceCheckUtils]: 51: Hoare triple {12215#false} assume 8448 == #t~mem68;havoc #t~mem68; {12215#false} is VALID [2022-04-08 08:43:27,798 INFO L290 TraceCheckUtils]: 52: Hoare triple {12215#false} assume !(~num1~0 > 0); {12215#false} is VALID [2022-04-08 08:43:27,798 INFO L290 TraceCheckUtils]: 53: Hoare triple {12215#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {12215#false} is VALID [2022-04-08 08:43:27,798 INFO L290 TraceCheckUtils]: 54: Hoare triple {12215#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); {12215#false} is VALID [2022-04-08 08:43:27,798 INFO L290 TraceCheckUtils]: 55: Hoare triple {12215#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12215#false} is VALID [2022-04-08 08:43:27,798 INFO L290 TraceCheckUtils]: 56: Hoare triple {12215#false} ~skip~0 := 0; {12215#false} is VALID [2022-04-08 08:43:27,798 INFO L290 TraceCheckUtils]: 57: Hoare triple {12215#false} assume !false; {12215#false} is VALID [2022-04-08 08:43:27,798 INFO L290 TraceCheckUtils]: 58: Hoare triple {12215#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); {12215#false} is VALID [2022-04-08 08:43:27,798 INFO L290 TraceCheckUtils]: 59: Hoare triple {12215#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,799 INFO L290 TraceCheckUtils]: 60: Hoare triple {12215#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {12215#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,799 INFO L290 TraceCheckUtils]: 62: Hoare triple {12215#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,799 INFO L290 TraceCheckUtils]: 63: Hoare triple {12215#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,799 INFO L290 TraceCheckUtils]: 64: Hoare triple {12215#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,799 INFO L290 TraceCheckUtils]: 65: Hoare triple {12215#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,799 INFO L290 TraceCheckUtils]: 66: Hoare triple {12215#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,799 INFO L290 TraceCheckUtils]: 67: Hoare triple {12215#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,799 INFO L290 TraceCheckUtils]: 68: Hoare triple {12215#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {12215#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,799 INFO L290 TraceCheckUtils]: 70: Hoare triple {12215#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,799 INFO L290 TraceCheckUtils]: 71: Hoare triple {12215#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,799 INFO L290 TraceCheckUtils]: 72: Hoare triple {12215#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,799 INFO L290 TraceCheckUtils]: 73: Hoare triple {12215#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,800 INFO L290 TraceCheckUtils]: 74: Hoare triple {12215#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,800 INFO L290 TraceCheckUtils]: 75: Hoare triple {12215#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,800 INFO L290 TraceCheckUtils]: 76: Hoare triple {12215#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,800 INFO L290 TraceCheckUtils]: 77: Hoare triple {12215#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,800 INFO L290 TraceCheckUtils]: 78: Hoare triple {12215#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,800 INFO L290 TraceCheckUtils]: 79: Hoare triple {12215#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,800 INFO L290 TraceCheckUtils]: 80: Hoare triple {12215#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,800 INFO L290 TraceCheckUtils]: 81: Hoare triple {12215#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,800 INFO L290 TraceCheckUtils]: 82: Hoare triple {12215#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,800 INFO L290 TraceCheckUtils]: 83: Hoare triple {12215#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,800 INFO L290 TraceCheckUtils]: 84: Hoare triple {12215#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,800 INFO L290 TraceCheckUtils]: 85: Hoare triple {12215#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,800 INFO L290 TraceCheckUtils]: 86: Hoare triple {12215#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-08 08:43:27,800 INFO L290 TraceCheckUtils]: 87: Hoare triple {12215#false} assume 8640 == #t~mem75;havoc #t~mem75; {12215#false} is VALID [2022-04-08 08:43:27,801 INFO L290 TraceCheckUtils]: 88: Hoare triple {12215#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12215#false} is VALID [2022-04-08 08:43:27,801 INFO L290 TraceCheckUtils]: 89: Hoare triple {12215#false} assume !(4 == ~blastFlag~0); {12215#false} is VALID [2022-04-08 08:43:27,801 INFO L290 TraceCheckUtils]: 90: Hoare triple {12215#false} assume !false; {12215#false} is VALID [2022-04-08 08:43:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:43:27,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:27,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403118199] [2022-04-08 08:43:27,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403118199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:27,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:27,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:27,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:27,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [806062347] [2022-04-08 08:43:27,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [806062347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:27,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:27,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:27,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711682819] [2022-04-08 08:43:27,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:27,803 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 91 [2022-04-08 08:43:27,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:27,803 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-08 08:43:27,850 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-08 08:43:27,850 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:27,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:27,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:27,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:27,851 INFO L87 Difference]: Start difference. First operand 246 states and 394 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-08 08:43:30,684 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:32,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:34,608 INFO L93 Difference]: Finished difference Result 480 states and 771 transitions. [2022-04-08 08:43:34,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:34,609 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 91 [2022-04-08 08:43:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:34,609 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-08 08:43:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2022-04-08 08:43:34,612 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-08 08:43:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2022-04-08 08:43:34,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 433 transitions. [2022-04-08 08:43:34,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:34,890 INFO L225 Difference]: With dead ends: 480 [2022-04-08 08:43:34,890 INFO L226 Difference]: Without dead ends: 260 [2022-04-08 08:43:34,891 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:34,891 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 20 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:34,891 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 471 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2022-04-08 08:43:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-04-08 08:43:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 246. [2022-04-08 08:43:34,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:34,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand has 246 states, 241 states have (on average 1.6141078838174274) internal successors, (389), 241 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-08 08:43:34,902 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand has 246 states, 241 states have (on average 1.6141078838174274) internal successors, (389), 241 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-08 08:43:34,902 INFO L87 Difference]: Start difference. First operand 260 states. Second operand has 246 states, 241 states have (on average 1.6141078838174274) internal successors, (389), 241 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-08 08:43:34,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:34,907 INFO L93 Difference]: Finished difference Result 260 states and 411 transitions. [2022-04-08 08:43:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 411 transitions. [2022-04-08 08:43:34,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:34,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:34,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.6141078838174274) internal successors, (389), 241 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 260 states. [2022-04-08 08:43:34,908 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.6141078838174274) internal successors, (389), 241 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 260 states. [2022-04-08 08:43:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:34,912 INFO L93 Difference]: Finished difference Result 260 states and 411 transitions. [2022-04-08 08:43:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 411 transitions. [2022-04-08 08:43:34,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:34,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:34,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:34,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.6141078838174274) internal successors, (389), 241 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-08 08:43:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 393 transitions. [2022-04-08 08:43:34,917 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 393 transitions. Word has length 91 [2022-04-08 08:43:34,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:34,917 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 393 transitions. [2022-04-08 08:43:34,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:34,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 393 transitions. [2022-04-08 08:43:35,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:35,192 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 393 transitions. [2022-04-08 08:43:35,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 08:43:35,193 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:35,193 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:35,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:43:35,193 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:35,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:35,194 INFO L85 PathProgramCache]: Analyzing trace with hash -370582543, now seen corresponding path program 1 times [2022-04-08 08:43:35,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:35,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1284783233] [2022-04-08 08:43:35,227 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:35,227 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:35,227 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash -370582543, now seen corresponding path program 2 times [2022-04-08 08:43:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:35,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081424730] [2022-04-08 08:43:35,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:35,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:35,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:35,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {14205#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14198#true} is VALID [2022-04-08 08:43:35,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {14198#true} assume true; {14198#true} is VALID [2022-04-08 08:43:35,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14198#true} {14198#true} #673#return; {14198#true} is VALID [2022-04-08 08:43:35,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {14198#true} call ULTIMATE.init(); {14205#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:43:35,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {14205#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14198#true} is VALID [2022-04-08 08:43:35,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {14198#true} assume true; {14198#true} is VALID [2022-04-08 08:43:35,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14198#true} {14198#true} #673#return; {14198#true} is VALID [2022-04-08 08:43:35,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {14198#true} call #t~ret161 := main(); {14198#true} is VALID [2022-04-08 08:43:35,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {14198#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {14198#true} is VALID [2022-04-08 08:43:35,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {14198#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {14198#true} is VALID [2022-04-08 08:43:35,347 INFO L272 TraceCheckUtils]: 7: Hoare triple {14198#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14198#true} is VALID [2022-04-08 08:43:35,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {14198#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:35,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:35,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:35,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:35,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:35,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:35,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:35,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {14203#(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); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:35,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {14203#(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); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:35,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {14203#(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); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:35,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {14203#(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); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:35,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {14203#(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); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:35,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {14203#(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); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:35,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {14203#(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); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:35,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {14203#(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); {14204#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-08 08:43:35,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {14204#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {14199#false} is VALID [2022-04-08 08:43:35,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {14199#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {14199#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); {14199#false} is VALID [2022-04-08 08:43:35,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {14199#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14199#false} is VALID [2022-04-08 08:43:35,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {14199#false} ~skip~0 := 0; {14199#false} is VALID [2022-04-08 08:43:35,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {14199#false} assume !false; {14199#false} is VALID [2022-04-08 08:43:35,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {14199#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); {14199#false} is VALID [2022-04-08 08:43:35,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {14199#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {14199#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {14199#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {14199#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {14199#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {14199#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {14199#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {14199#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {14199#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {14199#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,355 INFO L290 TraceCheckUtils]: 40: Hoare triple {14199#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,355 INFO L290 TraceCheckUtils]: 41: Hoare triple {14199#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,355 INFO L290 TraceCheckUtils]: 42: Hoare triple {14199#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,356 INFO L290 TraceCheckUtils]: 43: Hoare triple {14199#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,356 INFO L290 TraceCheckUtils]: 44: Hoare triple {14199#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,356 INFO L290 TraceCheckUtils]: 45: Hoare triple {14199#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,356 INFO L290 TraceCheckUtils]: 46: Hoare triple {14199#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,356 INFO L290 TraceCheckUtils]: 47: Hoare triple {14199#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,356 INFO L290 TraceCheckUtils]: 48: Hoare triple {14199#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,356 INFO L290 TraceCheckUtils]: 49: Hoare triple {14199#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,356 INFO L290 TraceCheckUtils]: 50: Hoare triple {14199#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,356 INFO L290 TraceCheckUtils]: 51: Hoare triple {14199#false} assume 8448 == #t~mem68;havoc #t~mem68; {14199#false} is VALID [2022-04-08 08:43:35,356 INFO L290 TraceCheckUtils]: 52: Hoare triple {14199#false} assume !(~num1~0 > 0); {14199#false} is VALID [2022-04-08 08:43:35,356 INFO L290 TraceCheckUtils]: 53: Hoare triple {14199#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {14199#false} is VALID [2022-04-08 08:43:35,356 INFO L290 TraceCheckUtils]: 54: Hoare triple {14199#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); {14199#false} is VALID [2022-04-08 08:43:35,356 INFO L290 TraceCheckUtils]: 55: Hoare triple {14199#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14199#false} is VALID [2022-04-08 08:43:35,356 INFO L290 TraceCheckUtils]: 56: Hoare triple {14199#false} ~skip~0 := 0; {14199#false} is VALID [2022-04-08 08:43:35,357 INFO L290 TraceCheckUtils]: 57: Hoare triple {14199#false} assume !false; {14199#false} is VALID [2022-04-08 08:43:35,357 INFO L290 TraceCheckUtils]: 58: Hoare triple {14199#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); {14199#false} is VALID [2022-04-08 08:43:35,357 INFO L290 TraceCheckUtils]: 59: Hoare triple {14199#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,357 INFO L290 TraceCheckUtils]: 60: Hoare triple {14199#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,357 INFO L290 TraceCheckUtils]: 61: Hoare triple {14199#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,357 INFO L290 TraceCheckUtils]: 62: Hoare triple {14199#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,357 INFO L290 TraceCheckUtils]: 63: Hoare triple {14199#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,357 INFO L290 TraceCheckUtils]: 64: Hoare triple {14199#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,357 INFO L290 TraceCheckUtils]: 65: Hoare triple {14199#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,357 INFO L290 TraceCheckUtils]: 66: Hoare triple {14199#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,357 INFO L290 TraceCheckUtils]: 67: Hoare triple {14199#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,357 INFO L290 TraceCheckUtils]: 68: Hoare triple {14199#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,357 INFO L290 TraceCheckUtils]: 69: Hoare triple {14199#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,357 INFO L290 TraceCheckUtils]: 70: Hoare triple {14199#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,358 INFO L290 TraceCheckUtils]: 71: Hoare triple {14199#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,358 INFO L290 TraceCheckUtils]: 72: Hoare triple {14199#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,358 INFO L290 TraceCheckUtils]: 73: Hoare triple {14199#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,358 INFO L290 TraceCheckUtils]: 74: Hoare triple {14199#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,358 INFO L290 TraceCheckUtils]: 75: Hoare triple {14199#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,358 INFO L290 TraceCheckUtils]: 76: Hoare triple {14199#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,358 INFO L290 TraceCheckUtils]: 77: Hoare triple {14199#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,358 INFO L290 TraceCheckUtils]: 78: Hoare triple {14199#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,358 INFO L290 TraceCheckUtils]: 79: Hoare triple {14199#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,358 INFO L290 TraceCheckUtils]: 80: Hoare triple {14199#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,358 INFO L290 TraceCheckUtils]: 81: Hoare triple {14199#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,358 INFO L290 TraceCheckUtils]: 82: Hoare triple {14199#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,358 INFO L290 TraceCheckUtils]: 83: Hoare triple {14199#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,358 INFO L290 TraceCheckUtils]: 84: Hoare triple {14199#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,359 INFO L290 TraceCheckUtils]: 85: Hoare triple {14199#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,359 INFO L290 TraceCheckUtils]: 86: Hoare triple {14199#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-08 08:43:35,359 INFO L290 TraceCheckUtils]: 87: Hoare triple {14199#false} assume 8640 == #t~mem75;havoc #t~mem75; {14199#false} is VALID [2022-04-08 08:43:35,359 INFO L290 TraceCheckUtils]: 88: Hoare triple {14199#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {14199#false} is VALID [2022-04-08 08:43:35,359 INFO L290 TraceCheckUtils]: 89: Hoare triple {14199#false} assume !(4 == ~blastFlag~0); {14199#false} is VALID [2022-04-08 08:43:35,359 INFO L290 TraceCheckUtils]: 90: Hoare triple {14199#false} assume !false; {14199#false} is VALID [2022-04-08 08:43:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:43:35,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:35,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081424730] [2022-04-08 08:43:35,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081424730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:35,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:35,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:35,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:35,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1284783233] [2022-04-08 08:43:35,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1284783233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:35,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:35,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:35,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507980604] [2022-04-08 08:43:35,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:35,361 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 91 [2022-04-08 08:43:35,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:35,361 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-08 08:43:35,406 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-08 08:43:35,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:35,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:35,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:35,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:35,407 INFO L87 Difference]: Start difference. First operand 246 states and 393 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-08 08:43:42,217 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:43,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:43,327 INFO L93 Difference]: Finished difference Result 540 states and 854 transitions. [2022-04-08 08:43:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:43,327 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 91 [2022-04-08 08:43:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:43,327 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-08 08:43:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-08 08:43:43,330 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-08 08:43:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-08 08:43:43,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-08 08:43:43,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:43,760 INFO L225 Difference]: With dead ends: 540 [2022-04-08 08:43:43,760 INFO L226 Difference]: Without dead ends: 320 [2022-04-08 08:43:43,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:43,761 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 135 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:43,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 342 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-04-08 08:43:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-04-08 08:43:43,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 246. [2022-04-08 08:43:43,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:43,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 320 states. Second operand has 246 states, 241 states have (on average 1.6016597510373445) internal successors, (386), 241 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:43,776 INFO L74 IsIncluded]: Start isIncluded. First operand 320 states. Second operand has 246 states, 241 states have (on average 1.6016597510373445) internal successors, (386), 241 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:43,777 INFO L87 Difference]: Start difference. First operand 320 states. Second operand has 246 states, 241 states have (on average 1.6016597510373445) internal successors, (386), 241 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:43,782 INFO L93 Difference]: Finished difference Result 320 states and 492 transitions. [2022-04-08 08:43:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 492 transitions. [2022-04-08 08:43:43,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:43,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:43,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.6016597510373445) internal successors, (386), 241 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 320 states. [2022-04-08 08:43:43,784 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.6016597510373445) internal successors, (386), 241 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 320 states. [2022-04-08 08:43:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:43,789 INFO L93 Difference]: Finished difference Result 320 states and 492 transitions. [2022-04-08 08:43:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 492 transitions. [2022-04-08 08:43:43,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:43,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:43,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:43,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.6016597510373445) internal successors, (386), 241 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 390 transitions. [2022-04-08 08:43:43,794 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 390 transitions. Word has length 91 [2022-04-08 08:43:43,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:43,794 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 390 transitions. [2022-04-08 08:43:43,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:43,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 390 transitions. [2022-04-08 08:43:44,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 390 transitions. [2022-04-08 08:43:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 08:43:44,117 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:44,117 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:44,117 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:43:44,117 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:44,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:44,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2098405732, now seen corresponding path program 1 times [2022-04-08 08:43:44,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:44,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1984114781] [2022-04-08 08:43:44,302 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:43:44,303 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:44,303 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:44,304 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:43:44,305 INFO L85 PathProgramCache]: Analyzing trace with hash -717890858, now seen corresponding path program 1 times [2022-04-08 08:43:44,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:44,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890834185] [2022-04-08 08:43:44,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:44,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:44,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:44,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {16431#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16422#true} is VALID [2022-04-08 08:43:44,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {16422#true} assume true; {16422#true} is VALID [2022-04-08 08:43:44,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16422#true} {16422#true} #673#return; {16422#true} is VALID [2022-04-08 08:43:44,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {16422#true} call ULTIMATE.init(); {16431#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:43:44,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {16431#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16422#true} is VALID [2022-04-08 08:43:44,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {16422#true} assume true; {16422#true} is VALID [2022-04-08 08:43:44,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16422#true} {16422#true} #673#return; {16422#true} is VALID [2022-04-08 08:43:44,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {16422#true} call #t~ret161 := main(); {16422#true} is VALID [2022-04-08 08:43:44,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {16422#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16422#true} is VALID [2022-04-08 08:43:44,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {16422#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16427#(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-08 08:43:44,787 INFO L272 TraceCheckUtils]: 7: Hoare triple {16427#(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); {16428#(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-08 08:43:44,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {16428#(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;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {16429#(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-08 08:43:44,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {16429#(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; {16429#(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-08 08:43:44,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {16429#(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; {16429#(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-08 08:43:44,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {16429#(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)))); {16429#(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-08 08:43:44,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {16429#(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); {16430#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-08 08:43:44,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {16430#(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; {16423#false} is VALID [2022-04-08 08:43:44,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {16423#false} [679] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_10|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_314|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_10|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_10|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_28|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_26|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_5|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_10|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_24|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_26|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_26|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_28|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_14|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_24, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_5|, #memory_int=|v_#memory_int_303|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_314|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_16} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {16423#false} is VALID [2022-04-08 08:43:44,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {16423#false} [680] L1168_primed-->L1167-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16423#false} is VALID [2022-04-08 08:43:44,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {16423#false} [681] L1167-2-->L1168_primed: Formula: (or (let ((.cse6 (select |v_#memory_int_309| v_ssl3_accept_~s.base_114)) (.cse2 (+ 52 v_ssl3_accept_~s.offset_114))) (let ((.cse3 (select |v_#memory_$Pointer$.base_320| v_ssl3_accept_~s.base_114)) (.cse1 (select |v_#memory_$Pointer$.base_321| v_ssl3_accept_~s.base_114)) (.cse4 (+ 84 v_ssl3_accept_~s.offset_114)) (.cse7 (select |v_#memory_$Pointer$.offset_321| v_ssl3_accept_~s.base_114)) (.cse5 (select |v_#memory_$Pointer$.offset_320| v_ssl3_accept_~s.base_114)) (.cse0 (select .cse6 .cse2))) (and (= 8448 .cse0) (not (= 8465 .cse0)) (not (= 8544 .cse0)) (not (= 8528 .cse0)) (not (= .cse0 8480)) (not (= 8497 .cse0)) (not (= .cse0 8481)) (not (= 8545 .cse0)) (= v_ssl3_accept_~skip~0_25 0) (= (store |v_#memory_$Pointer$.base_321| v_ssl3_accept_~s.base_114 (store .cse1 .cse2 (select .cse3 .cse2))) |v_#memory_$Pointer$.base_320|) (not (= (select (select |v_#memory_int_308| (select .cse3 .cse4)) (+ 848 (select .cse5 .cse4))) 0)) (not (= 8560 .cse0)) (not (= 8496 .cse0)) (not (= .cse0 8561)) (not (= .cse0 8529)) (= (store |v_#memory_int_309| v_ssl3_accept_~s.base_114 (store .cse6 .cse2 (select (select |v_#memory_int_309| (select .cse1 .cse4)) (+ 844 (select .cse7 .cse4))))) |v_#memory_int_308|) (not (< 0 v_ssl3_accept_~num1~0_13)) (not (= 8466 .cse0)) (= (store |v_#memory_$Pointer$.offset_321| v_ssl3_accept_~s.base_114 (store .cse7 .cse2 (select .cse5 .cse2))) |v_#memory_$Pointer$.offset_320|) (not (= .cse0 8512)) (not (= 8195 .cse0)) (not (= 8464 .cse0)) (= .cse0 v_ssl3_accept_~state~0_17) (not (= 8513 .cse0)) (not (= 8192 .cse0)) (not (= .cse0 16384)) (not (= 24576 .cse0)) (not (= 12292 .cse0)) (not (= 8482 .cse0))))) (and (= v_ssl3_accept_~s.base_114 v_ssl3_accept_~s.base_114) (= |v_#memory_int_309| |v_#memory_int_308|) (= |v_#memory_$Pointer$.offset_321| |v_#memory_$Pointer$.offset_320|) (= |v_#memory_$Pointer$.base_321| |v_#memory_$Pointer$.base_320|) (= v_ssl3_accept_~s.offset_114 v_ssl3_accept_~s.offset_114) (= v_ssl3_accept_~num1~0_13 v_ssl3_accept_~num1~0_13))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_114, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_321|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_13, #memory_int=|v_#memory_int_309|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_321|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_320|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_13, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_30|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_24|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_24|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_24|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_28|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_25, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_22|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_20|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_18|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_9|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_18|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_18|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_9|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_18|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_18|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_114, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_18|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_18|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_18|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_9|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_18|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_28|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_26|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_28|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_30|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_15|, #memory_int=|v_#memory_int_308|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_18|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_18|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_18|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_18|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_18|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_320|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_17} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {16423#false} is VALID [2022-04-08 08:43:44,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {16423#false} [678] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16423#false} is VALID [2022-04-08 08:43:44,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {16423#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); {16423#false} is VALID [2022-04-08 08:43:44,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {16423#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {16423#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {16423#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {16423#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {16423#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {16423#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {16423#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {16423#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {16423#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {16423#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {16423#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {16423#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {16423#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {16423#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {16423#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {16423#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {16423#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {16423#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {16423#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,794 INFO L290 TraceCheckUtils]: 38: Hoare triple {16423#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {16423#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,794 INFO L290 TraceCheckUtils]: 40: Hoare triple {16423#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,794 INFO L290 TraceCheckUtils]: 41: Hoare triple {16423#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {16423#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {16423#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {16423#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {16423#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {16423#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-08 08:43:44,794 INFO L290 TraceCheckUtils]: 47: Hoare triple {16423#false} assume 8640 == #t~mem75;havoc #t~mem75; {16423#false} is VALID [2022-04-08 08:43:44,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {16423#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16423#false} is VALID [2022-04-08 08:43:44,794 INFO L290 TraceCheckUtils]: 49: Hoare triple {16423#false} assume !(4 == ~blastFlag~0); {16423#false} is VALID [2022-04-08 08:43:44,794 INFO L290 TraceCheckUtils]: 50: Hoare triple {16423#false} assume !false; {16423#false} is VALID [2022-04-08 08:43:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 08:43:44,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:44,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890834185] [2022-04-08 08:43:44,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890834185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:44,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:44,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:43:44,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:44,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1984114781] [2022-04-08 08:43:44,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1984114781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:44,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:44,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:43:44,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334082330] [2022-04-08 08:43:44,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:44,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 92 [2022-04-08 08:43:44,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:44,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-08 08:43:44,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:44,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 08:43:44,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:44,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 08:43:44,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:43:44,844 INFO L87 Difference]: Start difference. First operand 246 states and 390 transitions. Second operand has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-08 08:43:47,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:53,731 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:57,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:57,472 INFO L93 Difference]: Finished difference Result 485 states and 772 transitions. [2022-04-08 08:43:57,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:43:57,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 92 [2022-04-08 08:43:57,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-08 08:43:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 410 transitions. [2022-04-08 08:43:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-08 08:43:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 410 transitions. [2022-04-08 08:43:57,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 410 transitions. [2022-04-08 08:43:57,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 410 edges. 410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:57,755 INFO L225 Difference]: With dead ends: 485 [2022-04-08 08:43:57,755 INFO L226 Difference]: Without dead ends: 246 [2022-04-08 08:43:57,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 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-08 08:43:57,756 INFO L913 BasicCegarLoop]: 203 mSDtfsCounter, 7 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:57,756 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 811 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-08 08:43:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-04-08 08:43:57,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-04-08 08:43:57,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:57,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand has 246 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 241 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-08 08:43:57,765 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand has 246 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 241 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-08 08:43:57,766 INFO L87 Difference]: Start difference. First operand 246 states. Second operand has 246 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 241 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-08 08:43:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:57,768 INFO L93 Difference]: Finished difference Result 246 states and 389 transitions. [2022-04-08 08:43:57,769 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 389 transitions. [2022-04-08 08:43:57,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:57,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:57,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 241 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 246 states. [2022-04-08 08:43:57,770 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 241 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 246 states. [2022-04-08 08:43:57,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:57,772 INFO L93 Difference]: Finished difference Result 246 states and 389 transitions. [2022-04-08 08:43:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 389 transitions. [2022-04-08 08:43:57,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:57,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:57,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:57,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 241 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-08 08:43:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 389 transitions. [2022-04-08 08:43:57,777 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 389 transitions. Word has length 92 [2022-04-08 08:43:57,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:57,777 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 389 transitions. [2022-04-08 08:43:57,777 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-08 08:43:57,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 389 transitions. [2022-04-08 08:43:58,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 389 transitions. [2022-04-08 08:43:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 08:43:58,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:58,069 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:58,069 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:43:58,069 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:58,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:58,070 INFO L85 PathProgramCache]: Analyzing trace with hash 139830946, now seen corresponding path program 1 times [2022-04-08 08:43:58,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:58,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1673975232] [2022-04-08 08:43:58,238 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:43:58,239 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:58,239 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:58,240 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:43:58,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1175085352, now seen corresponding path program 1 times [2022-04-08 08:43:58,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:58,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149658495] [2022-04-08 08:43:58,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:58,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:43:58,469 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:43:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:43:58,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:43:58,617 INFO L85 PathProgramCache]: Analyzing trace with hash 139830946, now seen corresponding path program 2 times [2022-04-08 08:43:58,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:58,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131047501] [2022-04-08 08:43:58,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:58,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:58,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {18401#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18394#true} is VALID [2022-04-08 08:43:58,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {18394#true} assume true; {18394#true} is VALID [2022-04-08 08:43:58,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18394#true} {18394#true} #673#return; {18394#true} is VALID [2022-04-08 08:43:58,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {18394#true} call ULTIMATE.init(); {18401#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:43:58,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {18401#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18394#true} is VALID [2022-04-08 08:43:58,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {18394#true} assume true; {18394#true} is VALID [2022-04-08 08:43:58,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18394#true} {18394#true} #673#return; {18394#true} is VALID [2022-04-08 08:43:58,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {18394#true} call #t~ret161 := main(); {18394#true} is VALID [2022-04-08 08:43:58,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {18394#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18394#true} is VALID [2022-04-08 08:43:58,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {18394#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {18394#true} is VALID [2022-04-08 08:43:58,768 INFO L272 TraceCheckUtils]: 7: Hoare triple {18394#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18394#true} is VALID [2022-04-08 08:43:58,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {18394#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18399#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:58,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {18399#(= 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; {18399#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:58,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {18399#(= 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; {18399#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:58,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {18399#(= 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)))); {18399#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:58,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {18399#(= 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); {18399#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:58,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {18399#(= 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; {18399#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:58,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {18399#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {18399#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:58,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {18399#(= 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); {18399#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:58,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {18399#(= 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); {18399#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:58,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {18399#(= 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); {18400#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-08 08:43:58,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {18400#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {18395#false} is VALID [2022-04-08 08:43:58,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {18395#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {18395#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18395#false} is VALID [2022-04-08 08:43:58,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {18395#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {18395#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); {18395#false} is VALID [2022-04-08 08:43:58,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {18395#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {18395#false} is VALID [2022-04-08 08:43:58,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {18395#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); {18395#false} is VALID [2022-04-08 08:43:58,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {18395#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); {18395#false} is VALID [2022-04-08 08:43:58,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {18395#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); {18395#false} is VALID [2022-04-08 08:43:58,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {18395#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18395#false} is VALID [2022-04-08 08:43:58,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {18395#false} ~skip~0 := 0; {18395#false} is VALID [2022-04-08 08:43:58,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {18395#false} assume !false; {18395#false} is VALID [2022-04-08 08:43:58,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {18395#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); {18395#false} is VALID [2022-04-08 08:43:58,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {18395#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {18395#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {18395#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {18395#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {18395#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {18395#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {18395#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {18395#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {18395#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {18395#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,779 INFO L290 TraceCheckUtils]: 41: Hoare triple {18395#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,779 INFO L290 TraceCheckUtils]: 42: Hoare triple {18395#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,779 INFO L290 TraceCheckUtils]: 43: Hoare triple {18395#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {18395#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {18395#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {18395#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,780 INFO L290 TraceCheckUtils]: 47: Hoare triple {18395#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,780 INFO L290 TraceCheckUtils]: 48: Hoare triple {18395#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,780 INFO L290 TraceCheckUtils]: 49: Hoare triple {18395#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,780 INFO L290 TraceCheckUtils]: 50: Hoare triple {18395#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,780 INFO L290 TraceCheckUtils]: 51: Hoare triple {18395#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {18395#false} assume 8448 == #t~mem68;havoc #t~mem68; {18395#false} is VALID [2022-04-08 08:43:58,780 INFO L290 TraceCheckUtils]: 53: Hoare triple {18395#false} assume !(~num1~0 > 0); {18395#false} is VALID [2022-04-08 08:43:58,780 INFO L290 TraceCheckUtils]: 54: Hoare triple {18395#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {18395#false} is VALID [2022-04-08 08:43:58,780 INFO L290 TraceCheckUtils]: 55: Hoare triple {18395#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); {18395#false} is VALID [2022-04-08 08:43:58,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {18395#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18395#false} is VALID [2022-04-08 08:43:58,780 INFO L290 TraceCheckUtils]: 57: Hoare triple {18395#false} ~skip~0 := 0; {18395#false} is VALID [2022-04-08 08:43:58,780 INFO L290 TraceCheckUtils]: 58: Hoare triple {18395#false} assume !false; {18395#false} is VALID [2022-04-08 08:43:58,781 INFO L290 TraceCheckUtils]: 59: Hoare triple {18395#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); {18395#false} is VALID [2022-04-08 08:43:58,781 INFO L290 TraceCheckUtils]: 60: Hoare triple {18395#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,781 INFO L290 TraceCheckUtils]: 61: Hoare triple {18395#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,781 INFO L290 TraceCheckUtils]: 62: Hoare triple {18395#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,781 INFO L290 TraceCheckUtils]: 63: Hoare triple {18395#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,781 INFO L290 TraceCheckUtils]: 64: Hoare triple {18395#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,781 INFO L290 TraceCheckUtils]: 65: Hoare triple {18395#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,781 INFO L290 TraceCheckUtils]: 66: Hoare triple {18395#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,781 INFO L290 TraceCheckUtils]: 67: Hoare triple {18395#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,781 INFO L290 TraceCheckUtils]: 68: Hoare triple {18395#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,781 INFO L290 TraceCheckUtils]: 69: Hoare triple {18395#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,781 INFO L290 TraceCheckUtils]: 70: Hoare triple {18395#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,781 INFO L290 TraceCheckUtils]: 71: Hoare triple {18395#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,781 INFO L290 TraceCheckUtils]: 72: Hoare triple {18395#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,782 INFO L290 TraceCheckUtils]: 73: Hoare triple {18395#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,782 INFO L290 TraceCheckUtils]: 74: Hoare triple {18395#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,782 INFO L290 TraceCheckUtils]: 75: Hoare triple {18395#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,782 INFO L290 TraceCheckUtils]: 76: Hoare triple {18395#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,782 INFO L290 TraceCheckUtils]: 77: Hoare triple {18395#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,782 INFO L290 TraceCheckUtils]: 78: Hoare triple {18395#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,782 INFO L290 TraceCheckUtils]: 79: Hoare triple {18395#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,782 INFO L290 TraceCheckUtils]: 80: Hoare triple {18395#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,782 INFO L290 TraceCheckUtils]: 81: Hoare triple {18395#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,782 INFO L290 TraceCheckUtils]: 82: Hoare triple {18395#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,782 INFO L290 TraceCheckUtils]: 83: Hoare triple {18395#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,782 INFO L290 TraceCheckUtils]: 84: Hoare triple {18395#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,782 INFO L290 TraceCheckUtils]: 85: Hoare triple {18395#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,782 INFO L290 TraceCheckUtils]: 86: Hoare triple {18395#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,783 INFO L290 TraceCheckUtils]: 87: Hoare triple {18395#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {18395#false} is VALID [2022-04-08 08:43:58,783 INFO L290 TraceCheckUtils]: 88: Hoare triple {18395#false} assume 8640 == #t~mem75;havoc #t~mem75; {18395#false} is VALID [2022-04-08 08:43:58,783 INFO L290 TraceCheckUtils]: 89: Hoare triple {18395#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18395#false} is VALID [2022-04-08 08:43:58,783 INFO L290 TraceCheckUtils]: 90: Hoare triple {18395#false} assume !(4 == ~blastFlag~0); {18395#false} is VALID [2022-04-08 08:43:58,783 INFO L290 TraceCheckUtils]: 91: Hoare triple {18395#false} assume !false; {18395#false} is VALID [2022-04-08 08:43:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:43:58,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:58,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131047501] [2022-04-08 08:43:58,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131047501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:58,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:58,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:58,784 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:58,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1673975232] [2022-04-08 08:43:58,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1673975232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:58,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:58,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:58,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049958854] [2022-04-08 08:43:58,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:58,785 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 92 [2022-04-08 08:43:58,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:58,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:58,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:58,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:58,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:58,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:58,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:58,826 INFO L87 Difference]: Start difference. First operand 246 states and 389 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:03,227 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:05,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:08,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:09,023 INFO L93 Difference]: Finished difference Result 479 states and 763 transitions. [2022-04-08 08:44:09,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:09,024 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 92 [2022-04-08 08:44:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-08 08:44:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-08 08:44:09,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 429 transitions. [2022-04-08 08:44:09,293 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-08 08:44:09,302 INFO L225 Difference]: With dead ends: 479 [2022-04-08 08:44:09,302 INFO L226 Difference]: Without dead ends: 259 [2022-04-08 08:44:09,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:44:09,303 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:09,304 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 471 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 347 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-04-08 08:44:09,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-08 08:44:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 246. [2022-04-08 08:44:09,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:09,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 241 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:09,313 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 241 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:09,314 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 241 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:09,317 INFO L93 Difference]: Finished difference Result 259 states and 405 transitions. [2022-04-08 08:44:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 405 transitions. [2022-04-08 08:44:09,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:09,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:09,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 241 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-08 08:44:09,318 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 241 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-08 08:44:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:09,322 INFO L93 Difference]: Finished difference Result 259 states and 405 transitions. [2022-04-08 08:44:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 405 transitions. [2022-04-08 08:44:09,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:09,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:09,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:09,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 241 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 388 transitions. [2022-04-08 08:44:09,326 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 388 transitions. Word has length 92 [2022-04-08 08:44:09,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:09,326 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 388 transitions. [2022-04-08 08:44:09,327 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:09,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 388 transitions. [2022-04-08 08:44:09,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 388 transitions. [2022-04-08 08:44:09,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-08 08:44:09,607 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:09,607 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:09,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2022-04-08 08:44:09,607 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:09,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:09,608 INFO L85 PathProgramCache]: Analyzing trace with hash 395726886, now seen corresponding path program 1 times [2022-04-08 08:44:09,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:09,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1952685879] [2022-04-08 08:44:09,773 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:44:09,774 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:09,774 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:09,774 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:44:09,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1769201112, now seen corresponding path program 1 times [2022-04-08 08:44:09,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:09,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218808253] [2022-04-08 08:44:09,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:09,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:44:09,939 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:44:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:44:10,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:44:10,026 INFO L85 PathProgramCache]: Analyzing trace with hash 395726886, now seen corresponding path program 2 times [2022-04-08 08:44:10,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:10,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642168914] [2022-04-08 08:44:10,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:10,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:10,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:10,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {20381#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20374#true} is VALID [2022-04-08 08:44:10,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {20374#true} assume true; {20374#true} is VALID [2022-04-08 08:44:10,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20374#true} {20374#true} #673#return; {20374#true} is VALID [2022-04-08 08:44:10,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {20374#true} call ULTIMATE.init(); {20381#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:44:10,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {20381#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20374#true} is VALID [2022-04-08 08:44:10,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {20374#true} assume true; {20374#true} is VALID [2022-04-08 08:44:10,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20374#true} {20374#true} #673#return; {20374#true} is VALID [2022-04-08 08:44:10,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {20374#true} call #t~ret161 := main(); {20374#true} is VALID [2022-04-08 08:44:10,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {20374#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {20374#true} is VALID [2022-04-08 08:44:10,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {20374#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {20374#true} is VALID [2022-04-08 08:44:10,126 INFO L272 TraceCheckUtils]: 7: Hoare triple {20374#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20374#true} is VALID [2022-04-08 08:44:10,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {20374#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {20379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {20379#(= 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; {20379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {20379#(= 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; {20379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {20379#(= 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)))); {20379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {20379#(= 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); {20379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {20379#(= 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; {20379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {20379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {20379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {20379#(= 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); {20379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {20379#(= 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); {20379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {20379#(= 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); {20379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {20379#(= 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); {20380#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-08 08:44:10,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {20380#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {20375#false} is VALID [2022-04-08 08:44:10,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {20375#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {20375#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20375#false} is VALID [2022-04-08 08:44:10,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {20375#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {20375#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); {20375#false} is VALID [2022-04-08 08:44:10,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {20375#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {20375#false} is VALID [2022-04-08 08:44:10,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {20375#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); {20375#false} is VALID [2022-04-08 08:44:10,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {20375#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); {20375#false} is VALID [2022-04-08 08:44:10,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {20375#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); {20375#false} is VALID [2022-04-08 08:44:10,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {20375#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20375#false} is VALID [2022-04-08 08:44:10,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {20375#false} ~skip~0 := 0; {20375#false} is VALID [2022-04-08 08:44:10,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {20375#false} assume !false; {20375#false} is VALID [2022-04-08 08:44:10,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {20375#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); {20375#false} is VALID [2022-04-08 08:44:10,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {20375#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {20375#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {20375#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {20375#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {20375#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {20375#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {20375#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {20375#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {20375#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {20375#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {20375#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {20375#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {20375#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {20375#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {20375#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,141 INFO L290 TraceCheckUtils]: 47: Hoare triple {20375#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,141 INFO L290 TraceCheckUtils]: 48: Hoare triple {20375#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,141 INFO L290 TraceCheckUtils]: 49: Hoare triple {20375#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,141 INFO L290 TraceCheckUtils]: 50: Hoare triple {20375#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,141 INFO L290 TraceCheckUtils]: 51: Hoare triple {20375#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,141 INFO L290 TraceCheckUtils]: 52: Hoare triple {20375#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,141 INFO L290 TraceCheckUtils]: 53: Hoare triple {20375#false} assume 8448 == #t~mem68;havoc #t~mem68; {20375#false} is VALID [2022-04-08 08:44:10,142 INFO L290 TraceCheckUtils]: 54: Hoare triple {20375#false} assume !(~num1~0 > 0); {20375#false} is VALID [2022-04-08 08:44:10,142 INFO L290 TraceCheckUtils]: 55: Hoare triple {20375#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {20375#false} is VALID [2022-04-08 08:44:10,142 INFO L290 TraceCheckUtils]: 56: Hoare triple {20375#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); {20375#false} is VALID [2022-04-08 08:44:10,142 INFO L290 TraceCheckUtils]: 57: Hoare triple {20375#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20375#false} is VALID [2022-04-08 08:44:10,142 INFO L290 TraceCheckUtils]: 58: Hoare triple {20375#false} ~skip~0 := 0; {20375#false} is VALID [2022-04-08 08:44:10,142 INFO L290 TraceCheckUtils]: 59: Hoare triple {20375#false} assume !false; {20375#false} is VALID [2022-04-08 08:44:10,142 INFO L290 TraceCheckUtils]: 60: Hoare triple {20375#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); {20375#false} is VALID [2022-04-08 08:44:10,142 INFO L290 TraceCheckUtils]: 61: Hoare triple {20375#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,142 INFO L290 TraceCheckUtils]: 62: Hoare triple {20375#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,142 INFO L290 TraceCheckUtils]: 63: Hoare triple {20375#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,142 INFO L290 TraceCheckUtils]: 64: Hoare triple {20375#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,142 INFO L290 TraceCheckUtils]: 65: Hoare triple {20375#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {20375#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {20375#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,143 INFO L290 TraceCheckUtils]: 68: Hoare triple {20375#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,143 INFO L290 TraceCheckUtils]: 69: Hoare triple {20375#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,143 INFO L290 TraceCheckUtils]: 70: Hoare triple {20375#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,143 INFO L290 TraceCheckUtils]: 71: Hoare triple {20375#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,143 INFO L290 TraceCheckUtils]: 72: Hoare triple {20375#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,143 INFO L290 TraceCheckUtils]: 73: Hoare triple {20375#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,143 INFO L290 TraceCheckUtils]: 74: Hoare triple {20375#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,143 INFO L290 TraceCheckUtils]: 75: Hoare triple {20375#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,143 INFO L290 TraceCheckUtils]: 76: Hoare triple {20375#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,143 INFO L290 TraceCheckUtils]: 77: Hoare triple {20375#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,143 INFO L290 TraceCheckUtils]: 78: Hoare triple {20375#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,143 INFO L290 TraceCheckUtils]: 79: Hoare triple {20375#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,143 INFO L290 TraceCheckUtils]: 80: Hoare triple {20375#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,144 INFO L290 TraceCheckUtils]: 81: Hoare triple {20375#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,144 INFO L290 TraceCheckUtils]: 82: Hoare triple {20375#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,144 INFO L290 TraceCheckUtils]: 83: Hoare triple {20375#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,144 INFO L290 TraceCheckUtils]: 84: Hoare triple {20375#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,144 INFO L290 TraceCheckUtils]: 85: Hoare triple {20375#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,144 INFO L290 TraceCheckUtils]: 86: Hoare triple {20375#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,144 INFO L290 TraceCheckUtils]: 87: Hoare triple {20375#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,144 INFO L290 TraceCheckUtils]: 88: Hoare triple {20375#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {20375#false} is VALID [2022-04-08 08:44:10,144 INFO L290 TraceCheckUtils]: 89: Hoare triple {20375#false} assume 8640 == #t~mem75;havoc #t~mem75; {20375#false} is VALID [2022-04-08 08:44:10,144 INFO L290 TraceCheckUtils]: 90: Hoare triple {20375#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {20375#false} is VALID [2022-04-08 08:44:10,144 INFO L290 TraceCheckUtils]: 91: Hoare triple {20375#false} assume !(4 == ~blastFlag~0); {20375#false} is VALID [2022-04-08 08:44:10,144 INFO L290 TraceCheckUtils]: 92: Hoare triple {20375#false} assume !false; {20375#false} is VALID [2022-04-08 08:44:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:44:10,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:10,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642168914] [2022-04-08 08:44:10,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642168914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:10,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:10,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:10,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:10,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1952685879] [2022-04-08 08:44:10,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1952685879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:10,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:10,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:10,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224916181] [2022-04-08 08:44:10,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:10,146 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 93 [2022-04-08 08:44:10,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:10,146 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-08 08:44:10,188 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-08 08:44:10,189 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:10,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:10,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:10,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:10,189 INFO L87 Difference]: Start difference. First operand 246 states and 388 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-08 08:44:14,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:19,666 INFO L93 Difference]: Finished difference Result 479 states and 762 transitions. [2022-04-08 08:44:19,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:19,666 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 93 [2022-04-08 08:44:19,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:19,667 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-08 08:44:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-08 08:44:19,668 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-08 08:44:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-08 08:44:19,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 428 transitions. [2022-04-08 08:44:19,936 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-08 08:44:19,939 INFO L225 Difference]: With dead ends: 479 [2022-04-08 08:44:19,939 INFO L226 Difference]: Without dead ends: 259 [2022-04-08 08:44:19,940 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:44:19,940 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 20 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:19,941 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 471 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 347 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-04-08 08:44:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-08 08:44:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 246. [2022-04-08 08:44:19,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:19,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5892116182572613) internal successors, (383), 241 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:19,948 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5892116182572613) internal successors, (383), 241 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:19,949 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5892116182572613) internal successors, (383), 241 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:19,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:19,952 INFO L93 Difference]: Finished difference Result 259 states and 404 transitions. [2022-04-08 08:44:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 404 transitions. [2022-04-08 08:44:19,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:19,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:19,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.5892116182572613) internal successors, (383), 241 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-08 08:44:19,957 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.5892116182572613) internal successors, (383), 241 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-08 08:44:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:19,961 INFO L93 Difference]: Finished difference Result 259 states and 404 transitions. [2022-04-08 08:44:19,961 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 404 transitions. [2022-04-08 08:44:19,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:19,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:19,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:19,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5892116182572613) internal successors, (383), 241 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:19,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 387 transitions. [2022-04-08 08:44:19,965 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 387 transitions. Word has length 93 [2022-04-08 08:44:19,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:19,965 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 387 transitions. [2022-04-08 08:44:19,965 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:19,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 387 transitions. [2022-04-08 08:44:20,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 387 transitions. [2022-04-08 08:44:20,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-08 08:44:20,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:20,352 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:20,352 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12 [2022-04-08 08:44:20,352 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:20,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:20,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1956623549, now seen corresponding path program 1 times [2022-04-08 08:44:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:20,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [556866376] [2022-04-08 08:44:20,574 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:44:20,575 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:20,575 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:20,576 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:44:20,576 INFO L85 PathProgramCache]: Analyzing trace with hash 418520280, now seen corresponding path program 1 times [2022-04-08 08:44:20,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:20,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354247472] [2022-04-08 08:44:20,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:20,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:44:20,699 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:44:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:44:20,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:44:20,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1956623549, now seen corresponding path program 2 times [2022-04-08 08:44:20,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:20,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621187912] [2022-04-08 08:44:20,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:20,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:20,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:20,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {22361#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22354#true} is VALID [2022-04-08 08:44:20,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {22354#true} assume true; {22354#true} is VALID [2022-04-08 08:44:20,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22354#true} {22354#true} #673#return; {22354#true} is VALID [2022-04-08 08:44:20,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {22354#true} call ULTIMATE.init(); {22361#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:44:20,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {22361#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22354#true} is VALID [2022-04-08 08:44:20,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {22354#true} assume true; {22354#true} is VALID [2022-04-08 08:44:20,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22354#true} {22354#true} #673#return; {22354#true} is VALID [2022-04-08 08:44:20,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {22354#true} call #t~ret161 := main(); {22354#true} is VALID [2022-04-08 08:44:20,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {22354#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {22354#true} is VALID [2022-04-08 08:44:20,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {22354#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {22354#true} is VALID [2022-04-08 08:44:20,877 INFO L272 TraceCheckUtils]: 7: Hoare triple {22354#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22354#true} is VALID [2022-04-08 08:44:20,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {22354#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {22359#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:20,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {22359#(= 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; {22359#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:20,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {22359#(= 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; {22359#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:20,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {22359#(= 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)))); {22359#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:20,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {22359#(= 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); {22359#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:20,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {22359#(= 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; {22359#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:20,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {22359#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {22359#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:20,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {22359#(= 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); {22359#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:20,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {22359#(= 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); {22359#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:20,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {22359#(= 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); {22359#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:20,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {22359#(= 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); {22359#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:20,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {22359#(= 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); {22360#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-08 08:44:20,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {22360#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {22355#false} is VALID [2022-04-08 08:44:20,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {22355#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {22355#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {22355#false} is VALID [2022-04-08 08:44:20,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {22355#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {22355#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); {22355#false} is VALID [2022-04-08 08:44:20,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {22355#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {22355#false} is VALID [2022-04-08 08:44:20,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {22355#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); {22355#false} is VALID [2022-04-08 08:44:20,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {22355#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); {22355#false} is VALID [2022-04-08 08:44:20,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {22355#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); {22355#false} is VALID [2022-04-08 08:44:20,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {22355#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22355#false} is VALID [2022-04-08 08:44:20,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {22355#false} ~skip~0 := 0; {22355#false} is VALID [2022-04-08 08:44:20,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {22355#false} assume !false; {22355#false} is VALID [2022-04-08 08:44:20,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {22355#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); {22355#false} is VALID [2022-04-08 08:44:20,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {22355#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {22355#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {22355#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {22355#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {22355#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {22355#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {22355#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {22355#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {22355#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {22355#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {22355#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {22355#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,884 INFO L290 TraceCheckUtils]: 45: Hoare triple {22355#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {22355#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,885 INFO L290 TraceCheckUtils]: 47: Hoare triple {22355#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,885 INFO L290 TraceCheckUtils]: 48: Hoare triple {22355#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,885 INFO L290 TraceCheckUtils]: 49: Hoare triple {22355#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,885 INFO L290 TraceCheckUtils]: 50: Hoare triple {22355#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,885 INFO L290 TraceCheckUtils]: 51: Hoare triple {22355#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,885 INFO L290 TraceCheckUtils]: 52: Hoare triple {22355#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,885 INFO L290 TraceCheckUtils]: 53: Hoare triple {22355#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,885 INFO L290 TraceCheckUtils]: 54: Hoare triple {22355#false} assume 8448 == #t~mem68;havoc #t~mem68; {22355#false} is VALID [2022-04-08 08:44:20,885 INFO L290 TraceCheckUtils]: 55: Hoare triple {22355#false} assume !(~num1~0 > 0); {22355#false} is VALID [2022-04-08 08:44:20,885 INFO L290 TraceCheckUtils]: 56: Hoare triple {22355#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {22355#false} is VALID [2022-04-08 08:44:20,885 INFO L290 TraceCheckUtils]: 57: Hoare triple {22355#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); {22355#false} is VALID [2022-04-08 08:44:20,885 INFO L290 TraceCheckUtils]: 58: Hoare triple {22355#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22355#false} is VALID [2022-04-08 08:44:20,885 INFO L290 TraceCheckUtils]: 59: Hoare triple {22355#false} ~skip~0 := 0; {22355#false} is VALID [2022-04-08 08:44:20,886 INFO L290 TraceCheckUtils]: 60: Hoare triple {22355#false} assume !false; {22355#false} is VALID [2022-04-08 08:44:20,886 INFO L290 TraceCheckUtils]: 61: Hoare triple {22355#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); {22355#false} is VALID [2022-04-08 08:44:20,886 INFO L290 TraceCheckUtils]: 62: Hoare triple {22355#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,886 INFO L290 TraceCheckUtils]: 63: Hoare triple {22355#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,886 INFO L290 TraceCheckUtils]: 64: Hoare triple {22355#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,886 INFO L290 TraceCheckUtils]: 65: Hoare triple {22355#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,886 INFO L290 TraceCheckUtils]: 66: Hoare triple {22355#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,886 INFO L290 TraceCheckUtils]: 67: Hoare triple {22355#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,886 INFO L290 TraceCheckUtils]: 68: Hoare triple {22355#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,886 INFO L290 TraceCheckUtils]: 69: Hoare triple {22355#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,886 INFO L290 TraceCheckUtils]: 70: Hoare triple {22355#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,886 INFO L290 TraceCheckUtils]: 71: Hoare triple {22355#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,886 INFO L290 TraceCheckUtils]: 72: Hoare triple {22355#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,886 INFO L290 TraceCheckUtils]: 73: Hoare triple {22355#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,887 INFO L290 TraceCheckUtils]: 74: Hoare triple {22355#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,887 INFO L290 TraceCheckUtils]: 75: Hoare triple {22355#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,887 INFO L290 TraceCheckUtils]: 76: Hoare triple {22355#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,887 INFO L290 TraceCheckUtils]: 77: Hoare triple {22355#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,887 INFO L290 TraceCheckUtils]: 78: Hoare triple {22355#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,887 INFO L290 TraceCheckUtils]: 79: Hoare triple {22355#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,887 INFO L290 TraceCheckUtils]: 80: Hoare triple {22355#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,887 INFO L290 TraceCheckUtils]: 81: Hoare triple {22355#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,887 INFO L290 TraceCheckUtils]: 82: Hoare triple {22355#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,887 INFO L290 TraceCheckUtils]: 83: Hoare triple {22355#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,887 INFO L290 TraceCheckUtils]: 84: Hoare triple {22355#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,887 INFO L290 TraceCheckUtils]: 85: Hoare triple {22355#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,887 INFO L290 TraceCheckUtils]: 86: Hoare triple {22355#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,888 INFO L290 TraceCheckUtils]: 87: Hoare triple {22355#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,888 INFO L290 TraceCheckUtils]: 88: Hoare triple {22355#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,888 INFO L290 TraceCheckUtils]: 89: Hoare triple {22355#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {22355#false} is VALID [2022-04-08 08:44:20,888 INFO L290 TraceCheckUtils]: 90: Hoare triple {22355#false} assume 8640 == #t~mem75;havoc #t~mem75; {22355#false} is VALID [2022-04-08 08:44:20,888 INFO L290 TraceCheckUtils]: 91: Hoare triple {22355#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {22355#false} is VALID [2022-04-08 08:44:20,888 INFO L290 TraceCheckUtils]: 92: Hoare triple {22355#false} assume !(4 == ~blastFlag~0); {22355#false} is VALID [2022-04-08 08:44:20,888 INFO L290 TraceCheckUtils]: 93: Hoare triple {22355#false} assume !false; {22355#false} is VALID [2022-04-08 08:44:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:44:20,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:20,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621187912] [2022-04-08 08:44:20,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621187912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:20,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:20,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:20,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:20,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [556866376] [2022-04-08 08:44:20,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [556866376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:20,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:20,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:20,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752932078] [2022-04-08 08:44:20,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:20,890 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 94 [2022-04-08 08:44:20,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:20,890 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-08 08:44:20,935 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-08 08:44:20,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:20,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:20,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:20,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:20,936 INFO L87 Difference]: Start difference. First operand 246 states and 387 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-08 08:44:22,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:26,108 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:30,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:31,225 INFO L93 Difference]: Finished difference Result 469 states and 748 transitions. [2022-04-08 08:44:31,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:31,225 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 94 [2022-04-08 08:44:31,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:31,225 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-08 08:44:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 414 transitions. [2022-04-08 08:44:31,227 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-08 08:44:31,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 414 transitions. [2022-04-08 08:44:31,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 414 transitions. [2022-04-08 08:44:31,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 414 edges. 414 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:31,470 INFO L225 Difference]: With dead ends: 469 [2022-04-08 08:44:31,470 INFO L226 Difference]: Without dead ends: 249 [2022-04-08 08:44:31,471 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:44:31,471 INFO L913 BasicCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:31,471 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 485 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-08 08:44:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-08 08:44:31,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2022-04-08 08:44:31,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:31,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 246 states, 241 states have (on average 1.5850622406639003) internal successors, (382), 241 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:31,479 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 246 states, 241 states have (on average 1.5850622406639003) internal successors, (382), 241 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:31,479 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 246 states, 241 states have (on average 1.5850622406639003) internal successors, (382), 241 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:31,482 INFO L93 Difference]: Finished difference Result 249 states and 390 transitions. [2022-04-08 08:44:31,482 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 390 transitions. [2022-04-08 08:44:31,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:31,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:31,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.5850622406639003) internal successors, (382), 241 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 249 states. [2022-04-08 08:44:31,483 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.5850622406639003) internal successors, (382), 241 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 249 states. [2022-04-08 08:44:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:31,486 INFO L93 Difference]: Finished difference Result 249 states and 390 transitions. [2022-04-08 08:44:31,486 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 390 transitions. [2022-04-08 08:44:31,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:31,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:31,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:31,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5850622406639003) internal successors, (382), 241 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 386 transitions. [2022-04-08 08:44:31,490 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 386 transitions. Word has length 94 [2022-04-08 08:44:31,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:31,490 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 386 transitions. [2022-04-08 08:44:31,490 INFO L479 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-08 08:44:31,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 386 transitions. [2022-04-08 08:44:31,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 386 transitions. [2022-04-08 08:44:31,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-08 08:44:31,768 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:31,768 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:31,768 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,SelfDestructingSolverStorable14 [2022-04-08 08:44:31,768 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:31,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:31,768 INFO L85 PathProgramCache]: Analyzing trace with hash -879532300, now seen corresponding path program 1 times [2022-04-08 08:44:31,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:31,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [791071823] [2022-04-08 08:44:31,816 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:31,816 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:31,816 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:31,816 INFO L85 PathProgramCache]: Analyzing trace with hash -879532300, now seen corresponding path program 2 times [2022-04-08 08:44:31,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:31,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685444733] [2022-04-08 08:44:31,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:31,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:31,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:31,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {24301#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24294#true} is VALID [2022-04-08 08:44:31,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {24294#true} assume true; {24294#true} is VALID [2022-04-08 08:44:31,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24294#true} {24294#true} #673#return; {24294#true} is VALID [2022-04-08 08:44:31,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {24294#true} call ULTIMATE.init(); {24301#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:44:31,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {24301#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24294#true} is VALID [2022-04-08 08:44:31,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {24294#true} assume true; {24294#true} is VALID [2022-04-08 08:44:31,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24294#true} {24294#true} #673#return; {24294#true} is VALID [2022-04-08 08:44:31,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {24294#true} call #t~ret161 := main(); {24294#true} is VALID [2022-04-08 08:44:31,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {24294#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {24294#true} is VALID [2022-04-08 08:44:31,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {24294#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {24294#true} is VALID [2022-04-08 08:44:31,917 INFO L272 TraceCheckUtils]: 7: Hoare triple {24294#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {24294#true} is VALID [2022-04-08 08:44:31,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {24294#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {24294#true} is VALID [2022-04-08 08:44:31,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {24294#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; {24294#true} is VALID [2022-04-08 08:44:31,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {24294#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; {24294#true} is VALID [2022-04-08 08:44:31,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {24294#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24294#true} is VALID [2022-04-08 08:44:31,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {24294#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {24294#true} is VALID [2022-04-08 08:44:31,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {24294#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {24294#true} is VALID [2022-04-08 08:44:31,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {24294#true} assume !false; {24294#true} is VALID [2022-04-08 08:44:31,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {24294#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); {24294#true} is VALID [2022-04-08 08:44:31,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {24294#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24294#true} is VALID [2022-04-08 08:44:31,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {24294#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24294#true} is VALID [2022-04-08 08:44:31,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {24294#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24294#true} is VALID [2022-04-08 08:44:31,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {24294#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24294#true} is VALID [2022-04-08 08:44:31,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {24294#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24294#true} is VALID [2022-04-08 08:44:31,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {24294#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24294#true} is VALID [2022-04-08 08:44:31,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {24294#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24294#true} is VALID [2022-04-08 08:44:31,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {24294#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24294#true} is VALID [2022-04-08 08:44:31,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {24294#true} assume 8464 == #t~mem55;havoc #t~mem55; {24294#true} is VALID [2022-04-08 08:44:31,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {24294#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; {24294#true} is VALID [2022-04-08 08:44:31,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {24294#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24294#true} is VALID [2022-04-08 08:44:31,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {24294#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); {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {24299#(= 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); {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {24299#(= 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; {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {24299#(= 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); {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {24299#(= 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); {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {24299#(= 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); {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {24299#(= 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); {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {24299#(= 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); {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {24299#(= 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); {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {24299#(= 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); {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,923 INFO L290 TraceCheckUtils]: 39: Hoare triple {24299#(= 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); {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {24299#(= 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); {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,924 INFO L290 TraceCheckUtils]: 41: Hoare triple {24299#(= 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); {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,924 INFO L290 TraceCheckUtils]: 42: Hoare triple {24299#(= 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); {24299#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:31,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {24299#(= 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); {24300#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-08 08:44:31,925 INFO L290 TraceCheckUtils]: 44: Hoare triple {24300#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,925 INFO L290 TraceCheckUtils]: 45: Hoare triple {24295#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,925 INFO L290 TraceCheckUtils]: 46: Hoare triple {24295#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,925 INFO L290 TraceCheckUtils]: 47: Hoare triple {24295#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,925 INFO L290 TraceCheckUtils]: 48: Hoare triple {24295#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,925 INFO L290 TraceCheckUtils]: 49: Hoare triple {24295#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,925 INFO L290 TraceCheckUtils]: 50: Hoare triple {24295#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,926 INFO L290 TraceCheckUtils]: 51: Hoare triple {24295#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,926 INFO L290 TraceCheckUtils]: 52: Hoare triple {24295#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,926 INFO L290 TraceCheckUtils]: 53: Hoare triple {24295#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,926 INFO L290 TraceCheckUtils]: 54: Hoare triple {24295#false} assume 8448 == #t~mem68;havoc #t~mem68; {24295#false} is VALID [2022-04-08 08:44:31,926 INFO L290 TraceCheckUtils]: 55: Hoare triple {24295#false} assume !(~num1~0 > 0); {24295#false} is VALID [2022-04-08 08:44:31,926 INFO L290 TraceCheckUtils]: 56: Hoare triple {24295#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {24295#false} is VALID [2022-04-08 08:44:31,926 INFO L290 TraceCheckUtils]: 57: Hoare triple {24295#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); {24295#false} is VALID [2022-04-08 08:44:31,926 INFO L290 TraceCheckUtils]: 58: Hoare triple {24295#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24295#false} is VALID [2022-04-08 08:44:31,926 INFO L290 TraceCheckUtils]: 59: Hoare triple {24295#false} ~skip~0 := 0; {24295#false} is VALID [2022-04-08 08:44:31,926 INFO L290 TraceCheckUtils]: 60: Hoare triple {24295#false} assume !false; {24295#false} is VALID [2022-04-08 08:44:31,926 INFO L290 TraceCheckUtils]: 61: Hoare triple {24295#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); {24295#false} is VALID [2022-04-08 08:44:31,926 INFO L290 TraceCheckUtils]: 62: Hoare triple {24295#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,926 INFO L290 TraceCheckUtils]: 63: Hoare triple {24295#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,926 INFO L290 TraceCheckUtils]: 64: Hoare triple {24295#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,927 INFO L290 TraceCheckUtils]: 65: Hoare triple {24295#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,927 INFO L290 TraceCheckUtils]: 66: Hoare triple {24295#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,927 INFO L290 TraceCheckUtils]: 67: Hoare triple {24295#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,927 INFO L290 TraceCheckUtils]: 68: Hoare triple {24295#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,927 INFO L290 TraceCheckUtils]: 69: Hoare triple {24295#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,927 INFO L290 TraceCheckUtils]: 70: Hoare triple {24295#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,927 INFO L290 TraceCheckUtils]: 71: Hoare triple {24295#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,927 INFO L290 TraceCheckUtils]: 72: Hoare triple {24295#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,927 INFO L290 TraceCheckUtils]: 73: Hoare triple {24295#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,927 INFO L290 TraceCheckUtils]: 74: Hoare triple {24295#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,927 INFO L290 TraceCheckUtils]: 75: Hoare triple {24295#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,927 INFO L290 TraceCheckUtils]: 76: Hoare triple {24295#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,927 INFO L290 TraceCheckUtils]: 77: Hoare triple {24295#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,927 INFO L290 TraceCheckUtils]: 78: Hoare triple {24295#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,928 INFO L290 TraceCheckUtils]: 79: Hoare triple {24295#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,928 INFO L290 TraceCheckUtils]: 80: Hoare triple {24295#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,928 INFO L290 TraceCheckUtils]: 81: Hoare triple {24295#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,928 INFO L290 TraceCheckUtils]: 82: Hoare triple {24295#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,928 INFO L290 TraceCheckUtils]: 83: Hoare triple {24295#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,928 INFO L290 TraceCheckUtils]: 84: Hoare triple {24295#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,928 INFO L290 TraceCheckUtils]: 85: Hoare triple {24295#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,928 INFO L290 TraceCheckUtils]: 86: Hoare triple {24295#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,928 INFO L290 TraceCheckUtils]: 87: Hoare triple {24295#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,928 INFO L290 TraceCheckUtils]: 88: Hoare triple {24295#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,928 INFO L290 TraceCheckUtils]: 89: Hoare triple {24295#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {24295#false} is VALID [2022-04-08 08:44:31,928 INFO L290 TraceCheckUtils]: 90: Hoare triple {24295#false} assume 8640 == #t~mem75;havoc #t~mem75; {24295#false} is VALID [2022-04-08 08:44:31,928 INFO L290 TraceCheckUtils]: 91: Hoare triple {24295#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {24295#false} is VALID [2022-04-08 08:44:31,928 INFO L290 TraceCheckUtils]: 92: Hoare triple {24295#false} assume !(4 == ~blastFlag~0); {24295#false} is VALID [2022-04-08 08:44:31,929 INFO L290 TraceCheckUtils]: 93: Hoare triple {24295#false} assume !false; {24295#false} is VALID [2022-04-08 08:44:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 08:44:31,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:31,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685444733] [2022-04-08 08:44:31,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685444733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:31,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:31,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:31,929 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:31,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [791071823] [2022-04-08 08:44:31,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [791071823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:31,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:31,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:31,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039551233] [2022-04-08 08:44:31,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:31,930 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 94 [2022-04-08 08:44:31,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:31,930 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-08 08:44:31,984 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-08 08:44:31,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:31,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:31,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:31,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:31,985 INFO L87 Difference]: Start difference. First operand 246 states and 386 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-08 08:44:35,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:39,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:41,683 INFO L93 Difference]: Finished difference Result 508 states and 805 transitions. [2022-04-08 08:44:41,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:41,683 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 94 [2022-04-08 08:44:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:41,683 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-08 08:44:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 460 transitions. [2022-04-08 08:44:41,685 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-08 08:44:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 460 transitions. [2022-04-08 08:44:41,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 460 transitions. [2022-04-08 08:44:41,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:41,969 INFO L225 Difference]: With dead ends: 508 [2022-04-08 08:44:41,969 INFO L226 Difference]: Without dead ends: 288 [2022-04-08 08:44:41,970 INFO L912 BasicCegarLoop]: 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-08 08:44:41,970 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 31 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:41,970 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 485 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 08:44:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-04-08 08:44:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 268. [2022-04-08 08:44:41,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:41,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 288 states. Second operand has 268 states, 263 states have (on average 1.585551330798479) internal successors, (417), 263 states have internal predecessors, (417), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:41,978 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states. Second operand has 268 states, 263 states have (on average 1.585551330798479) internal successors, (417), 263 states have internal predecessors, (417), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:41,979 INFO L87 Difference]: Start difference. First operand 288 states. Second operand has 268 states, 263 states have (on average 1.585551330798479) internal successors, (417), 263 states have internal predecessors, (417), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:41,982 INFO L93 Difference]: Finished difference Result 288 states and 447 transitions. [2022-04-08 08:44:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 447 transitions. [2022-04-08 08:44:41,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:41,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:41,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.585551330798479) internal successors, (417), 263 states have internal predecessors, (417), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 288 states. [2022-04-08 08:44:41,983 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.585551330798479) internal successors, (417), 263 states have internal predecessors, (417), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 288 states. [2022-04-08 08:44:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:41,987 INFO L93 Difference]: Finished difference Result 288 states and 447 transitions. [2022-04-08 08:44:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 447 transitions. [2022-04-08 08:44:41,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:41,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:41,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:41,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.585551330798479) internal successors, (417), 263 states have internal predecessors, (417), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 421 transitions. [2022-04-08 08:44:41,991 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 421 transitions. Word has length 94 [2022-04-08 08:44:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:41,992 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 421 transitions. [2022-04-08 08:44:41,992 INFO L479 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-08 08:44:41,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 421 transitions. [2022-04-08 08:44:42,282 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-08 08:44:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 421 transitions. [2022-04-08 08:44:42,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-08 08:44:42,284 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:42,284 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:42,284 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:44:42,284 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:42,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:42,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1912041974, now seen corresponding path program 1 times [2022-04-08 08:44:42,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:42,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1932966653] [2022-04-08 08:44:42,367 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:42,367 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:42,367 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:42,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1912041974, now seen corresponding path program 2 times [2022-04-08 08:44:42,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:42,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454701412] [2022-04-08 08:44:42,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:42,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:42,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:42,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {26441#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26434#true} is VALID [2022-04-08 08:44:42,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {26434#true} assume true; {26434#true} is VALID [2022-04-08 08:44:42,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26434#true} {26434#true} #673#return; {26434#true} is VALID [2022-04-08 08:44:42,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {26434#true} call ULTIMATE.init(); {26441#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:44:42,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {26441#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26434#true} is VALID [2022-04-08 08:44:42,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {26434#true} assume true; {26434#true} is VALID [2022-04-08 08:44:42,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26434#true} {26434#true} #673#return; {26434#true} is VALID [2022-04-08 08:44:42,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {26434#true} call #t~ret161 := main(); {26434#true} is VALID [2022-04-08 08:44:42,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {26434#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {26434#true} is VALID [2022-04-08 08:44:42,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {26434#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {26434#true} is VALID [2022-04-08 08:44:42,468 INFO L272 TraceCheckUtils]: 7: Hoare triple {26434#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26434#true} is VALID [2022-04-08 08:44:42,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {26434#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {26434#true} is VALID [2022-04-08 08:44:42,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {26434#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; {26434#true} is VALID [2022-04-08 08:44:42,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {26434#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; {26434#true} is VALID [2022-04-08 08:44:42,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {26434#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26434#true} is VALID [2022-04-08 08:44:42,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {26434#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26434#true} is VALID [2022-04-08 08:44:42,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {26434#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26434#true} is VALID [2022-04-08 08:44:42,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {26434#true} assume !false; {26434#true} is VALID [2022-04-08 08:44:42,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {26434#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); {26434#true} is VALID [2022-04-08 08:44:42,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {26434#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26434#true} is VALID [2022-04-08 08:44:42,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {26434#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26434#true} is VALID [2022-04-08 08:44:42,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {26434#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26434#true} is VALID [2022-04-08 08:44:42,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {26434#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26434#true} is VALID [2022-04-08 08:44:42,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {26434#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26434#true} is VALID [2022-04-08 08:44:42,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {26434#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26434#true} is VALID [2022-04-08 08:44:42,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {26434#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26434#true} is VALID [2022-04-08 08:44:42,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {26434#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26434#true} is VALID [2022-04-08 08:44:42,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {26434#true} assume 8464 == #t~mem55;havoc #t~mem55; {26434#true} is VALID [2022-04-08 08:44:42,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {26434#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; {26434#true} is VALID [2022-04-08 08:44:42,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {26434#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26434#true} is VALID [2022-04-08 08:44:42,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {26434#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); {26434#true} is VALID [2022-04-08 08:44:42,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {26434#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); {26434#true} is VALID [2022-04-08 08:44:42,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {26434#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26434#true} is VALID [2022-04-08 08:44:42,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {26434#true} ~skip~0 := 0; {26434#true} is VALID [2022-04-08 08:44:42,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {26434#true} assume !false; {26434#true} is VALID [2022-04-08 08:44:42,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {26434#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); {26434#true} is VALID [2022-04-08 08:44:42,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {26434#true} assume 12292 == #t~mem47;havoc #t~mem47; {26434#true} is VALID [2022-04-08 08:44:42,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {26434#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {26434#true} is VALID [2022-04-08 08:44:42,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {26434#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {26434#true} is VALID [2022-04-08 08:44:42,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {26434#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26434#true} is VALID [2022-04-08 08:44:42,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {26434#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {26434#true} is VALID [2022-04-08 08:44:42,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {26434#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); {26434#true} is VALID [2022-04-08 08:44:42,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {26434#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {26434#true} is VALID [2022-04-08 08:44:42,470 INFO L290 TraceCheckUtils]: 40: Hoare triple {26434#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); {26434#true} is VALID [2022-04-08 08:44:42,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {26434#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); {26439#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:42,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {26439#(= 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); {26439#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:42,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {26439#(= 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; {26439#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:42,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {26439#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {26439#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:42,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {26439#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {26439#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:42,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {26439#(= 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); {26439#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:42,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {26439#(= 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); {26439#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:42,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {26439#(= 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); {26439#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:42,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {26439#(= 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); {26439#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:42,474 INFO L290 TraceCheckUtils]: 50: Hoare triple {26439#(= 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); {26439#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:42,474 INFO L290 TraceCheckUtils]: 51: Hoare triple {26439#(= 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); {26440#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-08 08:44:42,475 INFO L290 TraceCheckUtils]: 52: Hoare triple {26440#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,475 INFO L290 TraceCheckUtils]: 53: Hoare triple {26435#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,475 INFO L290 TraceCheckUtils]: 54: Hoare triple {26435#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,475 INFO L290 TraceCheckUtils]: 55: Hoare triple {26435#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {26435#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,475 INFO L290 TraceCheckUtils]: 57: Hoare triple {26435#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,475 INFO L290 TraceCheckUtils]: 58: Hoare triple {26435#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,475 INFO L290 TraceCheckUtils]: 59: Hoare triple {26435#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,475 INFO L290 TraceCheckUtils]: 60: Hoare triple {26435#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,475 INFO L290 TraceCheckUtils]: 61: Hoare triple {26435#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {26435#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,475 INFO L290 TraceCheckUtils]: 63: Hoare triple {26435#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,476 INFO L290 TraceCheckUtils]: 64: Hoare triple {26435#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,476 INFO L290 TraceCheckUtils]: 65: Hoare triple {26435#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {26435#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,476 INFO L290 TraceCheckUtils]: 67: Hoare triple {26435#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,476 INFO L290 TraceCheckUtils]: 68: Hoare triple {26435#false} assume 8448 == #t~mem68;havoc #t~mem68; {26435#false} is VALID [2022-04-08 08:44:42,476 INFO L290 TraceCheckUtils]: 69: Hoare triple {26435#false} assume !(~num1~0 > 0); {26435#false} is VALID [2022-04-08 08:44:42,476 INFO L290 TraceCheckUtils]: 70: Hoare triple {26435#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {26435#false} is VALID [2022-04-08 08:44:42,476 INFO L290 TraceCheckUtils]: 71: Hoare triple {26435#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); {26435#false} is VALID [2022-04-08 08:44:42,476 INFO L290 TraceCheckUtils]: 72: Hoare triple {26435#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26435#false} is VALID [2022-04-08 08:44:42,476 INFO L290 TraceCheckUtils]: 73: Hoare triple {26435#false} ~skip~0 := 0; {26435#false} is VALID [2022-04-08 08:44:42,476 INFO L290 TraceCheckUtils]: 74: Hoare triple {26435#false} assume !false; {26435#false} is VALID [2022-04-08 08:44:42,476 INFO L290 TraceCheckUtils]: 75: Hoare triple {26435#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); {26435#false} is VALID [2022-04-08 08:44:42,476 INFO L290 TraceCheckUtils]: 76: Hoare triple {26435#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,476 INFO L290 TraceCheckUtils]: 77: Hoare triple {26435#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,477 INFO L290 TraceCheckUtils]: 78: Hoare triple {26435#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,477 INFO L290 TraceCheckUtils]: 79: Hoare triple {26435#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,477 INFO L290 TraceCheckUtils]: 80: Hoare triple {26435#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,477 INFO L290 TraceCheckUtils]: 81: Hoare triple {26435#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,477 INFO L290 TraceCheckUtils]: 82: Hoare triple {26435#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,477 INFO L290 TraceCheckUtils]: 83: Hoare triple {26435#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,477 INFO L290 TraceCheckUtils]: 84: Hoare triple {26435#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,477 INFO L290 TraceCheckUtils]: 85: Hoare triple {26435#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,477 INFO L290 TraceCheckUtils]: 86: Hoare triple {26435#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,477 INFO L290 TraceCheckUtils]: 87: Hoare triple {26435#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,477 INFO L290 TraceCheckUtils]: 88: Hoare triple {26435#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,477 INFO L290 TraceCheckUtils]: 89: Hoare triple {26435#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,477 INFO L290 TraceCheckUtils]: 90: Hoare triple {26435#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,477 INFO L290 TraceCheckUtils]: 91: Hoare triple {26435#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,478 INFO L290 TraceCheckUtils]: 92: Hoare triple {26435#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,478 INFO L290 TraceCheckUtils]: 93: Hoare triple {26435#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,478 INFO L290 TraceCheckUtils]: 94: Hoare triple {26435#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,478 INFO L290 TraceCheckUtils]: 95: Hoare triple {26435#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,478 INFO L290 TraceCheckUtils]: 96: Hoare triple {26435#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,478 INFO L290 TraceCheckUtils]: 97: Hoare triple {26435#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,478 INFO L290 TraceCheckUtils]: 98: Hoare triple {26435#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,478 INFO L290 TraceCheckUtils]: 99: Hoare triple {26435#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,478 INFO L290 TraceCheckUtils]: 100: Hoare triple {26435#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,478 INFO L290 TraceCheckUtils]: 101: Hoare triple {26435#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,478 INFO L290 TraceCheckUtils]: 102: Hoare triple {26435#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,478 INFO L290 TraceCheckUtils]: 103: Hoare triple {26435#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {26435#false} is VALID [2022-04-08 08:44:42,478 INFO L290 TraceCheckUtils]: 104: Hoare triple {26435#false} assume 8640 == #t~mem75;havoc #t~mem75; {26435#false} is VALID [2022-04-08 08:44:42,478 INFO L290 TraceCheckUtils]: 105: Hoare triple {26435#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {26435#false} is VALID [2022-04-08 08:44:42,479 INFO L290 TraceCheckUtils]: 106: Hoare triple {26435#false} assume !(4 == ~blastFlag~0); {26435#false} is VALID [2022-04-08 08:44:42,479 INFO L290 TraceCheckUtils]: 107: Hoare triple {26435#false} assume !false; {26435#false} is VALID [2022-04-08 08:44:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-08 08:44:42,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:42,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454701412] [2022-04-08 08:44:42,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454701412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:42,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:42,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:42,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:42,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1932966653] [2022-04-08 08:44:42,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1932966653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:42,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:42,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:42,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061830530] [2022-04-08 08:44:42,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:42,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-08 08:44:42,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:42,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:42,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:42,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:42,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:42,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:42,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:42,536 INFO L87 Difference]: Start difference. First operand 268 states and 421 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:50,259 INFO L93 Difference]: Finished difference Result 523 states and 829 transitions. [2022-04-08 08:44:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:50,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-08 08:44:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 08:44:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 08:44:50,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-08 08:44:50,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:50,534 INFO L225 Difference]: With dead ends: 523 [2022-04-08 08:44:50,534 INFO L226 Difference]: Without dead ends: 281 [2022-04-08 08:44:50,534 INFO L912 BasicCegarLoop]: 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-08 08:44:50,535 INFO L913 BasicCegarLoop]: 224 mSDtfsCounter, 21 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:50,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 556 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 08:44:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-08 08:44:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 268. [2022-04-08 08:44:50,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:50,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 268 states, 263 states have (on average 1.5817490494296578) internal successors, (416), 263 states have internal predecessors, (416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:50,543 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 268 states, 263 states have (on average 1.5817490494296578) internal successors, (416), 263 states have internal predecessors, (416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:50,543 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 268 states, 263 states have (on average 1.5817490494296578) internal successors, (416), 263 states have internal predecessors, (416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:50,547 INFO L93 Difference]: Finished difference Result 281 states and 436 transitions. [2022-04-08 08:44:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 436 transitions. [2022-04-08 08:44:50,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:50,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:50,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.5817490494296578) internal successors, (416), 263 states have internal predecessors, (416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-08 08:44:50,548 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.5817490494296578) internal successors, (416), 263 states have internal predecessors, (416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-08 08:44:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:50,551 INFO L93 Difference]: Finished difference Result 281 states and 436 transitions. [2022-04-08 08:44:50,551 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 436 transitions. [2022-04-08 08:44:50,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:50,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:50,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:50,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.5817490494296578) internal successors, (416), 263 states have internal predecessors, (416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 420 transitions. [2022-04-08 08:44:50,555 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 420 transitions. Word has length 108 [2022-04-08 08:44:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:50,556 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 420 transitions. [2022-04-08 08:44:50,556 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:50,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 420 transitions. [2022-04-08 08:44:50,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 420 transitions. [2022-04-08 08:44:50,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-08 08:44:50,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:50,871 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:50,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:44:50,872 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:50,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:50,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1882989793, now seen corresponding path program 1 times [2022-04-08 08:44:50,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:50,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [991366700] [2022-04-08 08:44:50,929 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:50,929 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:50,929 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1882989793, now seen corresponding path program 2 times [2022-04-08 08:44:50,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:50,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168055983] [2022-04-08 08:44:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:51,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:51,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {28597#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28590#true} is VALID [2022-04-08 08:44:51,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {28590#true} assume true; {28590#true} is VALID [2022-04-08 08:44:51,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28590#true} {28590#true} #673#return; {28590#true} is VALID [2022-04-08 08:44:51,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {28590#true} call ULTIMATE.init(); {28597#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:44:51,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {28597#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28590#true} is VALID [2022-04-08 08:44:51,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {28590#true} assume true; {28590#true} is VALID [2022-04-08 08:44:51,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28590#true} {28590#true} #673#return; {28590#true} is VALID [2022-04-08 08:44:51,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {28590#true} call #t~ret161 := main(); {28590#true} is VALID [2022-04-08 08:44:51,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {28590#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {28590#true} is VALID [2022-04-08 08:44:51,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {28590#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {28590#true} is VALID [2022-04-08 08:44:51,100 INFO L272 TraceCheckUtils]: 7: Hoare triple {28590#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {28590#true} is VALID [2022-04-08 08:44:51,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {28590#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {28590#true} is VALID [2022-04-08 08:44:51,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {28590#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; {28590#true} is VALID [2022-04-08 08:44:51,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {28590#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; {28590#true} is VALID [2022-04-08 08:44:51,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {28590#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {28590#true} is VALID [2022-04-08 08:44:51,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {28590#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {28590#true} is VALID [2022-04-08 08:44:51,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {28590#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {28590#true} is VALID [2022-04-08 08:44:51,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {28590#true} assume !false; {28590#true} is VALID [2022-04-08 08:44:51,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {28590#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); {28590#true} is VALID [2022-04-08 08:44:51,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {28590#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28590#true} is VALID [2022-04-08 08:44:51,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {28590#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28590#true} is VALID [2022-04-08 08:44:51,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {28590#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28590#true} is VALID [2022-04-08 08:44:51,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {28590#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28590#true} is VALID [2022-04-08 08:44:51,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {28590#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28590#true} is VALID [2022-04-08 08:44:51,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {28590#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28590#true} is VALID [2022-04-08 08:44:51,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {28590#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28590#true} is VALID [2022-04-08 08:44:51,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {28590#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28590#true} is VALID [2022-04-08 08:44:51,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {28590#true} assume 8464 == #t~mem55;havoc #t~mem55; {28590#true} is VALID [2022-04-08 08:44:51,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {28590#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; {28590#true} is VALID [2022-04-08 08:44:51,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {28590#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28590#true} is VALID [2022-04-08 08:44:51,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {28590#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); {28595#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:51,102 INFO L290 TraceCheckUtils]: 28: Hoare triple {28595#(= 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); {28595#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:51,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {28595#(= 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; {28595#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:51,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {28595#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {28595#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:51,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {28595#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {28595#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:51,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {28595#(= 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); {28595#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:51,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {28595#(= 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); {28595#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:51,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {28595#(= 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); {28595#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:51,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {28595#(= 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); {28595#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:51,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {28595#(= 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); {28595#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:51,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {28595#(= 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); {28595#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:51,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {28595#(= 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); {28596#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-08 08:44:51,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {28596#(= |ssl3_accept_#t~mem53| 8496)} assume 8481 == #t~mem53;havoc #t~mem53; {28591#false} is VALID [2022-04-08 08:44:51,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {28591#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; {28591#false} is VALID [2022-04-08 08:44:51,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {28591#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); {28591#false} is VALID [2022-04-08 08:44:51,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {28591#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); {28591#false} is VALID [2022-04-08 08:44:51,110 INFO L290 TraceCheckUtils]: 43: Hoare triple {28591#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28591#false} is VALID [2022-04-08 08:44:51,110 INFO L290 TraceCheckUtils]: 44: Hoare triple {28591#false} ~skip~0 := 0; {28591#false} is VALID [2022-04-08 08:44:51,110 INFO L290 TraceCheckUtils]: 45: Hoare triple {28591#false} assume !false; {28591#false} is VALID [2022-04-08 08:44:51,110 INFO L290 TraceCheckUtils]: 46: Hoare triple {28591#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); {28591#false} is VALID [2022-04-08 08:44:51,110 INFO L290 TraceCheckUtils]: 47: Hoare triple {28591#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,110 INFO L290 TraceCheckUtils]: 48: Hoare triple {28591#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,110 INFO L290 TraceCheckUtils]: 49: Hoare triple {28591#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {28591#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,111 INFO L290 TraceCheckUtils]: 51: Hoare triple {28591#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,111 INFO L290 TraceCheckUtils]: 52: Hoare triple {28591#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,111 INFO L290 TraceCheckUtils]: 53: Hoare triple {28591#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,111 INFO L290 TraceCheckUtils]: 54: Hoare triple {28591#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,111 INFO L290 TraceCheckUtils]: 55: Hoare triple {28591#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,111 INFO L290 TraceCheckUtils]: 56: Hoare triple {28591#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,111 INFO L290 TraceCheckUtils]: 57: Hoare triple {28591#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,111 INFO L290 TraceCheckUtils]: 58: Hoare triple {28591#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,111 INFO L290 TraceCheckUtils]: 59: Hoare triple {28591#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,111 INFO L290 TraceCheckUtils]: 60: Hoare triple {28591#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {28591#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,111 INFO L290 TraceCheckUtils]: 62: Hoare triple {28591#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {28591#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {28591#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {28591#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,112 INFO L290 TraceCheckUtils]: 66: Hoare triple {28591#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,112 INFO L290 TraceCheckUtils]: 67: Hoare triple {28591#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {28591#false} assume 8448 == #t~mem68;havoc #t~mem68; {28591#false} is VALID [2022-04-08 08:44:51,112 INFO L290 TraceCheckUtils]: 69: Hoare triple {28591#false} assume !(~num1~0 > 0); {28591#false} is VALID [2022-04-08 08:44:51,112 INFO L290 TraceCheckUtils]: 70: Hoare triple {28591#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {28591#false} is VALID [2022-04-08 08:44:51,112 INFO L290 TraceCheckUtils]: 71: Hoare triple {28591#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); {28591#false} is VALID [2022-04-08 08:44:51,112 INFO L290 TraceCheckUtils]: 72: Hoare triple {28591#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28591#false} is VALID [2022-04-08 08:44:51,112 INFO L290 TraceCheckUtils]: 73: Hoare triple {28591#false} ~skip~0 := 0; {28591#false} is VALID [2022-04-08 08:44:51,112 INFO L290 TraceCheckUtils]: 74: Hoare triple {28591#false} assume !false; {28591#false} is VALID [2022-04-08 08:44:51,112 INFO L290 TraceCheckUtils]: 75: Hoare triple {28591#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); {28591#false} is VALID [2022-04-08 08:44:51,112 INFO L290 TraceCheckUtils]: 76: Hoare triple {28591#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,113 INFO L290 TraceCheckUtils]: 77: Hoare triple {28591#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,113 INFO L290 TraceCheckUtils]: 78: Hoare triple {28591#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,113 INFO L290 TraceCheckUtils]: 79: Hoare triple {28591#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,113 INFO L290 TraceCheckUtils]: 80: Hoare triple {28591#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,113 INFO L290 TraceCheckUtils]: 81: Hoare triple {28591#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,113 INFO L290 TraceCheckUtils]: 82: Hoare triple {28591#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,113 INFO L290 TraceCheckUtils]: 83: Hoare triple {28591#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,113 INFO L290 TraceCheckUtils]: 84: Hoare triple {28591#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,113 INFO L290 TraceCheckUtils]: 85: Hoare triple {28591#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,113 INFO L290 TraceCheckUtils]: 86: Hoare triple {28591#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,113 INFO L290 TraceCheckUtils]: 87: Hoare triple {28591#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,113 INFO L290 TraceCheckUtils]: 88: Hoare triple {28591#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,113 INFO L290 TraceCheckUtils]: 89: Hoare triple {28591#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,113 INFO L290 TraceCheckUtils]: 90: Hoare triple {28591#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,114 INFO L290 TraceCheckUtils]: 91: Hoare triple {28591#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,114 INFO L290 TraceCheckUtils]: 92: Hoare triple {28591#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,114 INFO L290 TraceCheckUtils]: 93: Hoare triple {28591#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,114 INFO L290 TraceCheckUtils]: 94: Hoare triple {28591#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,114 INFO L290 TraceCheckUtils]: 95: Hoare triple {28591#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,114 INFO L290 TraceCheckUtils]: 96: Hoare triple {28591#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,114 INFO L290 TraceCheckUtils]: 97: Hoare triple {28591#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,114 INFO L290 TraceCheckUtils]: 98: Hoare triple {28591#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,114 INFO L290 TraceCheckUtils]: 99: Hoare triple {28591#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,114 INFO L290 TraceCheckUtils]: 100: Hoare triple {28591#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,114 INFO L290 TraceCheckUtils]: 101: Hoare triple {28591#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,114 INFO L290 TraceCheckUtils]: 102: Hoare triple {28591#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,114 INFO L290 TraceCheckUtils]: 103: Hoare triple {28591#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {28591#false} is VALID [2022-04-08 08:44:51,114 INFO L290 TraceCheckUtils]: 104: Hoare triple {28591#false} assume 8640 == #t~mem75;havoc #t~mem75; {28591#false} is VALID [2022-04-08 08:44:51,115 INFO L290 TraceCheckUtils]: 105: Hoare triple {28591#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {28591#false} is VALID [2022-04-08 08:44:51,115 INFO L290 TraceCheckUtils]: 106: Hoare triple {28591#false} assume !(4 == ~blastFlag~0); {28591#false} is VALID [2022-04-08 08:44:51,115 INFO L290 TraceCheckUtils]: 107: Hoare triple {28591#false} assume !false; {28591#false} is VALID [2022-04-08 08:44:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:44:51,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:51,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168055983] [2022-04-08 08:44:51,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168055983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:51,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:51,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:51,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:51,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [991366700] [2022-04-08 08:44:51,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [991366700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:51,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:51,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:51,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409416619] [2022-04-08 08:44:51,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:51,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-08 08:44:51,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:51,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:51,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:51,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:51,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:51,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:51,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:51,186 INFO L87 Difference]: Start difference. First operand 268 states and 420 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:56,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:59,067 INFO L93 Difference]: Finished difference Result 528 states and 835 transitions. [2022-04-08 08:44:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:59,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-08 08:44:59,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-08 08:44:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-08 08:44:59,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 457 transitions. [2022-04-08 08:44:59,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:59,351 INFO L225 Difference]: With dead ends: 528 [2022-04-08 08:44:59,351 INFO L226 Difference]: Without dead ends: 286 [2022-04-08 08:44:59,351 INFO L912 BasicCegarLoop]: 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-08 08:44:59,352 INFO L913 BasicCegarLoop]: 191 mSDtfsCounter, 35 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:59,352 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 489 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-08 08:44:59,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-04-08 08:44:59,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 268. [2022-04-08 08:44:59,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:59,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand has 268 states, 263 states have (on average 1.5779467680608366) internal successors, (415), 263 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:59,360 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand has 268 states, 263 states have (on average 1.5779467680608366) internal successors, (415), 263 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:59,361 INFO L87 Difference]: Start difference. First operand 286 states. Second operand has 268 states, 263 states have (on average 1.5779467680608366) internal successors, (415), 263 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:59,364 INFO L93 Difference]: Finished difference Result 286 states and 443 transitions. [2022-04-08 08:44:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 443 transitions. [2022-04-08 08:44:59,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:59,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:59,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.5779467680608366) internal successors, (415), 263 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 286 states. [2022-04-08 08:44:59,365 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.5779467680608366) internal successors, (415), 263 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 286 states. [2022-04-08 08:44:59,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:59,369 INFO L93 Difference]: Finished difference Result 286 states and 443 transitions. [2022-04-08 08:44:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 443 transitions. [2022-04-08 08:44:59,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:59,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:59,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:59,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.5779467680608366) internal successors, (415), 263 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 419 transitions. [2022-04-08 08:44:59,375 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 419 transitions. Word has length 108 [2022-04-08 08:44:59,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:59,375 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 419 transitions. [2022-04-08 08:44:59,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:59,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 419 transitions. [2022-04-08 08:44:59,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 419 edges. 419 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 419 transitions. [2022-04-08 08:44:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-08 08:44:59,737 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:59,737 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:59,737 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:44:59,737 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:59,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:59,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1573585073, now seen corresponding path program 1 times [2022-04-08 08:44:59,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:59,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [693350426] [2022-04-08 08:44:59,903 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 17 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:44:59,903 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:59,903 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:59,904 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 08:44:59,906 INFO L158 Benchmark]: Toolchain (without parser) took 135755.95ms. Allocated memory was 218.1MB in the beginning and 350.2MB in the end (delta: 132.1MB). Free memory was 166.3MB in the beginning and 162.0MB in the end (delta: 4.3MB). Peak memory consumption was 136.4MB. Max. memory is 8.0GB. [2022-04-08 08:44:59,906 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 218.1MB. Free memory was 185.2MB in the beginning and 185.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:44:59,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.99ms. Allocated memory is still 218.1MB. Free memory was 166.2MB in the beginning and 169.9MB in the end (delta: -3.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 08:44:59,907 INFO L158 Benchmark]: Boogie Preprocessor took 91.71ms. Allocated memory is still 218.1MB. Free memory was 169.9MB in the beginning and 159.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 08:44:59,907 INFO L158 Benchmark]: RCFGBuilder took 1407.59ms. Allocated memory was 218.1MB in the beginning and 285.2MB in the end (delta: 67.1MB). Free memory was 159.9MB in the beginning and 194.5MB in the end (delta: -34.6MB). Peak memory consumption was 35.1MB. Max. memory is 8.0GB. [2022-04-08 08:44:59,907 INFO L158 Benchmark]: TraceAbstraction took 133757.85ms. Allocated memory was 285.2MB in the beginning and 350.2MB in the end (delta: 65.0MB). Free memory was 194.0MB in the beginning and 162.0MB in the end (delta: 31.9MB). Peak memory consumption was 97.0MB. Max. memory is 8.0GB. [2022-04-08 08:44:59,908 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.11ms. Allocated memory is still 218.1MB. Free memory was 185.2MB in the beginning and 185.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 490.99ms. Allocated memory is still 218.1MB. Free memory was 166.2MB in the beginning and 169.9MB in the end (delta: -3.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 91.71ms. Allocated memory is still 218.1MB. Free memory was 169.9MB in the beginning and 159.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1407.59ms. Allocated memory was 218.1MB in the beginning and 285.2MB in the end (delta: 67.1MB). Free memory was 159.9MB in the beginning and 194.5MB in the end (delta: -34.6MB). Peak memory consumption was 35.1MB. Max. memory is 8.0GB. * TraceAbstraction took 133757.85ms. Allocated memory was 285.2MB in the beginning and 350.2MB in the end (delta: 65.0MB). Free memory was 194.0MB in the beginning and 162.0MB in the end (delta: 31.9MB). Peak memory consumption was 97.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 08:44:59,943 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...