/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.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:37:27,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:37:27,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:37:27,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:37:27,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:37:27,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:37:27,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:37:27,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:37:27,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:37:27,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:37:27,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:37:27,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:37:27,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:37:27,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:37:27,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:37:27,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:37:27,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:37:27,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:37:27,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:37:27,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:37:27,104 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:37:27,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:37:27,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:37:27,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:37:27,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:37:27,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:37:27,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:37:27,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:37:27,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:37:27,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:37:27,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:37:27,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:37:27,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:37:27,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:37:27,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:37:27,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:37:27,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:37:27,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:37:27,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:37:27,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:37:27,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:37:27,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:37:27,126 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:37:27,133 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:37:27,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:37:27,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:37:27,135 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:37:27,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:37:27,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:37:27,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:37:27,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:37:27,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:37:27,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:37:27,136 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:37:27,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:37:27,136 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:37:27,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:37:27,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:37:27,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:37:27,137 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:37:27,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:37:27,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:37:27,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:37:27,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:37:27,138 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:37:27,138 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:37:27,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:37:27,139 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:37:27,144 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-15 11:37:27,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:37:27,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:37:27,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:37:27,398 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:37:27,398 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:37:27,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-04-15 11:37:27,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf56261d0/faa8e212d84a4ab482eb776aacbd1c64/FLAG5fe35a8eb [2022-04-15 11:37:27,979 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:37:27,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-04-15 11:37:28,009 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf56261d0/faa8e212d84a4ab482eb776aacbd1c64/FLAG5fe35a8eb [2022-04-15 11:37:28,474 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf56261d0/faa8e212d84a4ab482eb776aacbd1c64 [2022-04-15 11:37:28,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:37:28,477 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:37:28,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:37:28,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:37:28,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:37:28,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:37:28" (1/1) ... [2022-04-15 11:37:28,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa72c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:28, skipping insertion in model container [2022-04-15 11:37:28,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:37:28" (1/1) ... [2022-04-15 11:37:28,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:37:28,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:37:28,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-04-15 11:37:28,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:37:28,879 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:37:29,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-04-15 11:37:29,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:37:29,050 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:37:29,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:29 WrapperNode [2022-04-15 11:37:29,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:37:29,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:37:29,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:37:29,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:37:29,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:29" (1/1) ... [2022-04-15 11:37:29,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:29" (1/1) ... [2022-04-15 11:37:29,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:29" (1/1) ... [2022-04-15 11:37:29,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:29" (1/1) ... [2022-04-15 11:37:29,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:29" (1/1) ... [2022-04-15 11:37:29,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:29" (1/1) ... [2022-04-15 11:37:29,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:29" (1/1) ... [2022-04-15 11:37:29,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:37:29,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:37:29,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:37:29,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:37:29,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:29" (1/1) ... [2022-04-15 11:37:29,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:37:29,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:37:29,236 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-15 11:37:29,263 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-15 11:37:29,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:37:29,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:37:29,284 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:37:29,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-15 11:37:29,285 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-15 11:37:29,285 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:37:29,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 11:37:29,285 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:37:29,285 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:37:29,285 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:37:29,285 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:37:29,286 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:37:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:37:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:37:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:37:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:37:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:37:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:37:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:37:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:37:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-15 11:37:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:37:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 11:37:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-15 11:37:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:37:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:37:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:37:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:37:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:37:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:37:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:37:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:37:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:37:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:37:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:37:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:37:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:37:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:37:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:37:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:37:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:37:29,439 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:37:29,440 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:37:31,846 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:37:32,447 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-15 11:37:32,447 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-15 11:37:32,468 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:37:32,479 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:37:32,479 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:37:32,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:37:32 BoogieIcfgContainer [2022-04-15 11:37:32,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:37:32,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:37:32,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:37:32,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:37:32,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:37:28" (1/3) ... [2022-04-15 11:37:32,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4d8af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:37:32, skipping insertion in model container [2022-04-15 11:37:32,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:29" (2/3) ... [2022-04-15 11:37:32,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4d8af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:37:32, skipping insertion in model container [2022-04-15 11:37:32,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:37:32" (3/3) ... [2022-04-15 11:37:32,491 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-04-15 11:37:32,498 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:37:32,498 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:37:32,541 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:37:32,546 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-15 11:37:32,547 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:37:32,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 11:37:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 11:37:32,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:32,586 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, 1, 1, 1] [2022-04-15 11:37:32,587 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:32,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:32,591 INFO L85 PathProgramCache]: Analyzing trace with hash 740864289, now seen corresponding path program 1 times [2022-04-15 11:37:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:32,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1809787291] [2022-04-15 11:37:32,606 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:37:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash 740864289, now seen corresponding path program 2 times [2022-04-15 11:37:32,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:32,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465082978] [2022-04-15 11:37:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:32,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:33,095 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-15 11:37:33,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-15 11:37:33,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} #664#return; {158#true} is VALID [2022-04-15 11:37:33,098 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-15 11:37:33,098 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-15 11:37:33,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-15 11:37:33,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} #664#return; {158#true} is VALID [2022-04-15 11:37:33,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} call #t~ret162 := main(); {158#true} is VALID [2022-04-15 11:37:33,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {158#true} is VALID [2022-04-15 11:37:33,099 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-15 11:37:33,100 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-15 11:37:33,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:33,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {164#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-15 11:37:33,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {164#(= 8464 |ssl3_accept_#t~mem50|)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {159#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {159#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {159#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {159#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {159#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {159#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {159#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {159#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {159#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {159#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {159#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {159#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {159#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {159#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {159#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {159#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {159#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {159#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {159#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {159#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,130 INFO L290 TraceCheckUtils]: 45: Hoare triple {159#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {159#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {159#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-15 11:37:33,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {159#false} assume 8672 == #t~mem74;havoc #t~mem74; {159#false} is VALID [2022-04-15 11:37:33,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {159#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {159#false} is VALID [2022-04-15 11:37:33,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {159#false} assume 4 == ~blastFlag~0; {159#false} is VALID [2022-04-15 11:37:33,134 INFO L290 TraceCheckUtils]: 51: Hoare triple {159#false} assume !false; {159#false} is VALID [2022-04-15 11:37:33,138 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-15 11:37:33,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:33,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465082978] [2022-04-15 11:37:33,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465082978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:33,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:33,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:33,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:33,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1809787291] [2022-04-15 11:37:33,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1809787291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:33,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:33,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:33,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775516839] [2022-04-15 11:37:33,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:33,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 11:37:33,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:33,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:33,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:33,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:37:33,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:33,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:37:33,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:37:33,259 INFO L87 Difference]: Start difference. First operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:38,006 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-15 11:37:42,879 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-15 11:37:44,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:44,599 INFO L93 Difference]: Finished difference Result 328 states and 543 transitions. [2022-04-15 11:37:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:37:44,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 11:37:44,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-15 11:37:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-15 11:37:44,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 543 transitions. [2022-04-15 11:37:45,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 543 edges. 543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:45,118 INFO L225 Difference]: With dead ends: 328 [2022-04-15 11:37:45,118 INFO L226 Difference]: Without dead ends: 167 [2022-04-15 11:37:45,121 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-15 11:37:45,123 INFO L913 BasicCegarLoop]: 221 mSDtfsCounter, 33 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:45,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 583 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 405 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-04-15 11:37:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-15 11:37:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2022-04-15 11:37:45,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:45,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:45,163 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:45,164 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:45,172 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-15 11:37:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-15 11:37:45,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:45,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:45,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-15 11:37:45,176 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-15 11:37:45,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:45,187 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-15 11:37:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-15 11:37:45,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:45,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:45,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:45,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2022-04-15 11:37:45,202 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 52 [2022-04-15 11:37:45,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:45,203 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2022-04-15 11:37:45,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:45,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 227 transitions. [2022-04-15 11:37:45,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2022-04-15 11:37:45,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 11:37:45,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:45,389 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:37:45,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:37:45,389 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:45,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:45,390 INFO L85 PathProgramCache]: Analyzing trace with hash -444444622, now seen corresponding path program 1 times [2022-04-15 11:37:45,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:45,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1108981945] [2022-04-15 11:37:45,424 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:37:45,424 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:37:45,424 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:45,425 INFO L85 PathProgramCache]: Analyzing trace with hash -444444622, now seen corresponding path program 2 times [2022-04-15 11:37:45,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:45,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929741402] [2022-04-15 11:37:45,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:45,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:45,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:45,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {1467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {1460#true} is VALID [2022-04-15 11:37:45,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {1460#true} assume true; {1460#true} is VALID [2022-04-15 11:37:45,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1460#true} {1460#true} #664#return; {1460#true} is VALID [2022-04-15 11:37:45,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {1460#true} call ULTIMATE.init(); {1467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:37:45,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {1467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {1460#true} is VALID [2022-04-15 11:37:45,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {1460#true} assume true; {1460#true} is VALID [2022-04-15 11:37:45,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1460#true} {1460#true} #664#return; {1460#true} is VALID [2022-04-15 11:37:45,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {1460#true} call #t~ret162 := main(); {1460#true} is VALID [2022-04-15 11:37:45,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {1460#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1460#true} is VALID [2022-04-15 11:37:45,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {1460#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1460#true} is VALID [2022-04-15 11:37:45,623 INFO L272 TraceCheckUtils]: 7: Hoare triple {1460#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1460#true} is VALID [2022-04-15 11:37:45,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {1460#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:45,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:45,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:45,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#(= 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)))); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:45,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:45,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:45,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:45,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:45,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:45,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:45,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:45,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:45,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1466#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-15 11:37:45,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {1466#(= 8464 |ssl3_accept_#t~mem47|)} assume 8480 == #t~mem47;havoc #t~mem47; {1461#false} is VALID [2022-04-15 11:37:45,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {1461#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {1461#false} is VALID [2022-04-15 11:37:45,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {1461#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem88.base, 844 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {1461#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {1461#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {1461#false} is VALID [2022-04-15 11:37:45,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {1461#false} ~skip~0 := 0; {1461#false} is VALID [2022-04-15 11:37:45,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-15 11:37:45,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {1461#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {1461#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {1461#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {1461#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {1461#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {1461#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {1461#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {1461#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {1461#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {1461#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {1461#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {1461#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,636 INFO L290 TraceCheckUtils]: 40: Hoare triple {1461#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {1461#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {1461#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {1461#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {1461#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,637 INFO L290 TraceCheckUtils]: 45: Hoare triple {1461#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,637 INFO L290 TraceCheckUtils]: 46: Hoare triple {1461#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,637 INFO L290 TraceCheckUtils]: 47: Hoare triple {1461#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {1461#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,637 INFO L290 TraceCheckUtils]: 49: Hoare triple {1461#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,637 INFO L290 TraceCheckUtils]: 50: Hoare triple {1461#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,638 INFO L290 TraceCheckUtils]: 51: Hoare triple {1461#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,638 INFO L290 TraceCheckUtils]: 52: Hoare triple {1461#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,638 INFO L290 TraceCheckUtils]: 53: Hoare triple {1461#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,638 INFO L290 TraceCheckUtils]: 54: Hoare triple {1461#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,638 INFO L290 TraceCheckUtils]: 55: Hoare triple {1461#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,639 INFO L290 TraceCheckUtils]: 56: Hoare triple {1461#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,639 INFO L290 TraceCheckUtils]: 57: Hoare triple {1461#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,639 INFO L290 TraceCheckUtils]: 58: Hoare triple {1461#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,639 INFO L290 TraceCheckUtils]: 59: Hoare triple {1461#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,639 INFO L290 TraceCheckUtils]: 60: Hoare triple {1461#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 11:37:45,639 INFO L290 TraceCheckUtils]: 61: Hoare triple {1461#false} assume 8672 == #t~mem74;havoc #t~mem74; {1461#false} is VALID [2022-04-15 11:37:45,640 INFO L290 TraceCheckUtils]: 62: Hoare triple {1461#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {1461#false} is VALID [2022-04-15 11:37:45,640 INFO L290 TraceCheckUtils]: 63: Hoare triple {1461#false} assume 4 == ~blastFlag~0; {1461#false} is VALID [2022-04-15 11:37:45,640 INFO L290 TraceCheckUtils]: 64: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-15 11:37:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:37:45,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:45,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929741402] [2022-04-15 11:37:45,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929741402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:45,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:45,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:45,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:45,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1108981945] [2022-04-15 11:37:45,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1108981945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:45,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:45,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:45,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285698991] [2022-04-15 11:37:45,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:45,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 11:37:45,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:45,644 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-15 11:37:45,706 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-15 11:37:45,707 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:37:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:45,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:37:45,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:37:45,708 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:47,736 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-15 11:37:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:48,957 INFO L93 Difference]: Finished difference Result 291 states and 437 transitions. [2022-04-15 11:37:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:37:48,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 11:37:48,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:48,958 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-15 11:37:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-15 11:37:48,963 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-15 11:37:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-15 11:37:48,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 437 transitions. [2022-04-15 11:37:49,337 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-15 11:37:49,341 INFO L225 Difference]: With dead ends: 291 [2022-04-15 11:37:49,341 INFO L226 Difference]: Without dead ends: 167 [2022-04-15 11:37:49,347 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-15 11:37:49,351 INFO L913 BasicCegarLoop]: 180 mSDtfsCounter, 24 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:49,352 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 462 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 353 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:37:49,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-15 11:37:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2022-04-15 11:37:49,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:49,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:49,367 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:49,367 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:49,373 INFO L93 Difference]: Finished difference Result 167 states and 247 transitions. [2022-04-15 11:37:49,373 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2022-04-15 11:37:49,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:49,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:49,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-15 11:37:49,375 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-15 11:37:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:49,381 INFO L93 Difference]: Finished difference Result 167 states and 247 transitions. [2022-04-15 11:37:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2022-04-15 11:37:49,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:49,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:49,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:49,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 226 transitions. [2022-04-15 11:37:49,391 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 226 transitions. Word has length 65 [2022-04-15 11:37:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:49,392 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 226 transitions. [2022-04-15 11:37:49,393 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-15 11:37:49,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 226 transitions. [2022-04-15 11:37:49,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:49,574 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 226 transitions. [2022-04-15 11:37:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:37:49,575 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:49,575 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:37:49,575 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:37:49,575 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:49,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:49,576 INFO L85 PathProgramCache]: Analyzing trace with hash 795477037, now seen corresponding path program 1 times [2022-04-15 11:37:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:49,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1834358473] [2022-04-15 11:37:49,595 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:37:49,595 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:37:49,596 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash 795477037, now seen corresponding path program 2 times [2022-04-15 11:37:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:49,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886428880] [2022-04-15 11:37:49,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:49,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:49,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:49,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {2688#true} is VALID [2022-04-15 11:37:49,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {2688#true} assume true; {2688#true} is VALID [2022-04-15 11:37:49,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2688#true} {2688#true} #664#return; {2688#true} is VALID [2022-04-15 11:37:49,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {2688#true} call ULTIMATE.init(); {2695#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:37:49,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {2688#true} is VALID [2022-04-15 11:37:49,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {2688#true} assume true; {2688#true} is VALID [2022-04-15 11:37:49,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2688#true} {2688#true} #664#return; {2688#true} is VALID [2022-04-15 11:37:49,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {2688#true} call #t~ret162 := main(); {2688#true} is VALID [2022-04-15 11:37:49,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {2688#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {2688#true} is VALID [2022-04-15 11:37:49,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {2688#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2688#true} is VALID [2022-04-15 11:37:49,769 INFO L272 TraceCheckUtils]: 7: Hoare triple {2688#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2688#true} is VALID [2022-04-15 11:37:49,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {2688#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:37:49,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:37:49,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:37:49,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:37:49,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:37:49,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:37:49,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:37:49,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:37:49,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:37:49,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:37:49,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:37:49,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:37:49,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:37:49,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2694#(not (= |ssl3_accept_#t~mem48| 8481))} is VALID [2022-04-15 11:37:49,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {2694#(not (= |ssl3_accept_#t~mem48| 8481))} assume 8481 == #t~mem48;havoc #t~mem48; {2689#false} is VALID [2022-04-15 11:37:49,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {2689#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {2689#false} is VALID [2022-04-15 11:37:49,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {2689#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem88.base, 844 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {2689#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {2689#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {2689#false} is VALID [2022-04-15 11:37:49,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {2689#false} ~skip~0 := 0; {2689#false} is VALID [2022-04-15 11:37:49,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {2689#false} assume !false; {2689#false} is VALID [2022-04-15 11:37:49,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {2689#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {2689#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {2689#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {2689#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {2689#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {2689#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {2689#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {2689#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {2689#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {2689#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,783 INFO L290 TraceCheckUtils]: 39: Hoare triple {2689#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {2689#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {2689#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,783 INFO L290 TraceCheckUtils]: 42: Hoare triple {2689#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {2689#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {2689#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,784 INFO L290 TraceCheckUtils]: 45: Hoare triple {2689#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,784 INFO L290 TraceCheckUtils]: 46: Hoare triple {2689#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,784 INFO L290 TraceCheckUtils]: 47: Hoare triple {2689#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,784 INFO L290 TraceCheckUtils]: 48: Hoare triple {2689#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {2689#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,785 INFO L290 TraceCheckUtils]: 50: Hoare triple {2689#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,785 INFO L290 TraceCheckUtils]: 51: Hoare triple {2689#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,785 INFO L290 TraceCheckUtils]: 52: Hoare triple {2689#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {2689#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,785 INFO L290 TraceCheckUtils]: 54: Hoare triple {2689#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,785 INFO L290 TraceCheckUtils]: 55: Hoare triple {2689#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,785 INFO L290 TraceCheckUtils]: 56: Hoare triple {2689#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {2689#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,786 INFO L290 TraceCheckUtils]: 58: Hoare triple {2689#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,786 INFO L290 TraceCheckUtils]: 59: Hoare triple {2689#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {2689#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {2689#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 11:37:49,786 INFO L290 TraceCheckUtils]: 62: Hoare triple {2689#false} assume 8672 == #t~mem74;havoc #t~mem74; {2689#false} is VALID [2022-04-15 11:37:49,787 INFO L290 TraceCheckUtils]: 63: Hoare triple {2689#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {2689#false} is VALID [2022-04-15 11:37:49,787 INFO L290 TraceCheckUtils]: 64: Hoare triple {2689#false} assume 4 == ~blastFlag~0; {2689#false} is VALID [2022-04-15 11:37:49,787 INFO L290 TraceCheckUtils]: 65: Hoare triple {2689#false} assume !false; {2689#false} is VALID [2022-04-15 11:37:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:37:49,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:49,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886428880] [2022-04-15 11:37:49,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886428880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:49,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:49,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:49,788 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:49,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1834358473] [2022-04-15 11:37:49,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1834358473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:49,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:49,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:49,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711298397] [2022-04-15 11:37:49,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:49,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 11:37:49,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:49,790 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-15 11:37:49,840 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-15 11:37:49,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:37:49,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:49,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:37:49,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:37:49,841 INFO L87 Difference]: Start difference. First operand 150 states and 226 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-15 11:37:51,867 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-15 11:37:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:53,182 INFO L93 Difference]: Finished difference Result 390 states and 594 transitions. [2022-04-15 11:37:53,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:37:53,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 11:37:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:53,183 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-15 11:37:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-15 11:37:53,189 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-15 11:37:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-15 11:37:53,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-15 11:37:53,600 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-15 11:37:53,614 INFO L225 Difference]: With dead ends: 390 [2022-04-15 11:37:53,615 INFO L226 Difference]: Without dead ends: 266 [2022-04-15 11:37:53,615 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-15 11:37:53,616 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 139 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:53,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 321 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 11:37:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-04-15 11:37:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 167. [2022-04-15 11:37:53,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:53,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand has 167 states, 162 states have (on average 1.537037037037037) internal successors, (249), 162 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:53,630 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand has 167 states, 162 states have (on average 1.537037037037037) internal successors, (249), 162 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:53,630 INFO L87 Difference]: Start difference. First operand 266 states. Second operand has 167 states, 162 states have (on average 1.537037037037037) internal successors, (249), 162 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:53,645 INFO L93 Difference]: Finished difference Result 266 states and 403 transitions. [2022-04-15 11:37:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 403 transitions. [2022-04-15 11:37:53,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:53,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:53,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 162 states have (on average 1.537037037037037) internal successors, (249), 162 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 266 states. [2022-04-15 11:37:53,647 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.537037037037037) internal successors, (249), 162 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 266 states. [2022-04-15 11:37:53,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:53,662 INFO L93 Difference]: Finished difference Result 266 states and 403 transitions. [2022-04-15 11:37:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 403 transitions. [2022-04-15 11:37:53,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:53,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:53,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:53,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.537037037037037) internal successors, (249), 162 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 253 transitions. [2022-04-15 11:37:53,672 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 253 transitions. Word has length 66 [2022-04-15 11:37:53,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:53,672 INFO L478 AbstractCegarLoop]: Abstraction has 167 states and 253 transitions. [2022-04-15 11:37:53,672 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-15 11:37:53,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 253 transitions. [2022-04-15 11:37:53,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 253 transitions. [2022-04-15 11:37:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:37:53,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:53,873 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:37:53,873 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:37:53,873 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:53,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash -498657998, now seen corresponding path program 1 times [2022-04-15 11:37:53,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:53,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [742487149] [2022-04-15 11:37:53,890 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:37:53,890 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:37:53,890 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:53,890 INFO L85 PathProgramCache]: Analyzing trace with hash -498657998, now seen corresponding path program 2 times [2022-04-15 11:37:53,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:53,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786266973] [2022-04-15 11:37:53,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:53,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:54,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:54,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {4353#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {4346#true} is VALID [2022-04-15 11:37:54,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {4346#true} assume true; {4346#true} is VALID [2022-04-15 11:37:54,086 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4346#true} {4346#true} #664#return; {4346#true} is VALID [2022-04-15 11:37:54,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {4346#true} call ULTIMATE.init(); {4353#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:37:54,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {4353#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {4346#true} is VALID [2022-04-15 11:37:54,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {4346#true} assume true; {4346#true} is VALID [2022-04-15 11:37:54,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4346#true} {4346#true} #664#return; {4346#true} is VALID [2022-04-15 11:37:54,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {4346#true} call #t~ret162 := main(); {4346#true} is VALID [2022-04-15 11:37:54,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {4346#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {4346#true} is VALID [2022-04-15 11:37:54,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {4346#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4346#true} is VALID [2022-04-15 11:37:54,088 INFO L272 TraceCheckUtils]: 7: Hoare triple {4346#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4346#true} is VALID [2022-04-15 11:37:54,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {4346#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:54,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:54,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:54,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {4351#(= 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)))); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:54,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:54,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:54,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:54,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:54,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:54,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:54,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:54,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:54,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:54,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:54,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4352#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-15 11:37:54,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {4352#(= 8464 |ssl3_accept_#t~mem49|)} assume 8482 == #t~mem49;havoc #t~mem49; {4347#false} is VALID [2022-04-15 11:37:54,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {4347#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {4347#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {4347#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {4347#false} is VALID [2022-04-15 11:37:54,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {4347#false} ~skip~0 := 0; {4347#false} is VALID [2022-04-15 11:37:54,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {4347#false} assume !false; {4347#false} is VALID [2022-04-15 11:37:54,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {4347#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {4347#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {4347#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {4347#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {4347#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {4347#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {4347#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {4347#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {4347#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {4347#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {4347#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,101 INFO L290 TraceCheckUtils]: 40: Hoare triple {4347#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {4347#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {4347#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,101 INFO L290 TraceCheckUtils]: 43: Hoare triple {4347#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {4347#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {4347#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {4347#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,101 INFO L290 TraceCheckUtils]: 47: Hoare triple {4347#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {4347#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {4347#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,102 INFO L290 TraceCheckUtils]: 50: Hoare triple {4347#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {4347#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {4347#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {4347#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,102 INFO L290 TraceCheckUtils]: 54: Hoare triple {4347#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,103 INFO L290 TraceCheckUtils]: 55: Hoare triple {4347#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,103 INFO L290 TraceCheckUtils]: 56: Hoare triple {4347#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,103 INFO L290 TraceCheckUtils]: 57: Hoare triple {4347#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {4347#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,103 INFO L290 TraceCheckUtils]: 59: Hoare triple {4347#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,103 INFO L290 TraceCheckUtils]: 60: Hoare triple {4347#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {4347#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-15 11:37:54,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {4347#false} assume 8672 == #t~mem74;havoc #t~mem74; {4347#false} is VALID [2022-04-15 11:37:54,104 INFO L290 TraceCheckUtils]: 63: Hoare triple {4347#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {4347#false} is VALID [2022-04-15 11:37:54,104 INFO L290 TraceCheckUtils]: 64: Hoare triple {4347#false} assume 4 == ~blastFlag~0; {4347#false} is VALID [2022-04-15 11:37:54,104 INFO L290 TraceCheckUtils]: 65: Hoare triple {4347#false} assume !false; {4347#false} is VALID [2022-04-15 11:37:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:37:54,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:54,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786266973] [2022-04-15 11:37:54,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786266973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:54,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:54,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:54,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:54,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [742487149] [2022-04-15 11:37:54,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [742487149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:54,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:54,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:54,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9752081] [2022-04-15 11:37:54,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:54,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 11:37:54,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:54,107 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-15 11:37:54,152 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-15 11:37:54,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:37:54,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:54,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:37:54,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:37:54,153 INFO L87 Difference]: Start difference. First operand 167 states and 253 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-15 11:37:56,183 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-15 11:37:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:57,153 INFO L93 Difference]: Finished difference Result 322 states and 488 transitions. [2022-04-15 11:37:57,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:37:57,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 11:37:57,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:57,154 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-15 11:37:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-15 11:37:57,158 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-15 11:37:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-15 11:37:57,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 432 transitions. [2022-04-15 11:37:57,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:57,469 INFO L225 Difference]: With dead ends: 322 [2022-04-15 11:37:57,470 INFO L226 Difference]: Without dead ends: 181 [2022-04-15 11:37:57,470 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-15 11:37:57,471 INFO L913 BasicCegarLoop]: 183 mSDtfsCounter, 20 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:57,471 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 468 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 347 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:37:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-15 11:37:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 167. [2022-04-15 11:37:57,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:57,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 167 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:57,484 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 167 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:57,485 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 167 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:57,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:57,489 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2022-04-15 11:37:57,490 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2022-04-15 11:37:57,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:57,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:57,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 181 states. [2022-04-15 11:37:57,491 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 181 states. [2022-04-15 11:37:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:57,495 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2022-04-15 11:37:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2022-04-15 11:37:57,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:57,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:57,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:57,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 252 transitions. [2022-04-15 11:37:57,501 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 252 transitions. Word has length 66 [2022-04-15 11:37:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:57,501 INFO L478 AbstractCegarLoop]: Abstraction has 167 states and 252 transitions. [2022-04-15 11:37:57,502 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-15 11:37:57,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 252 transitions. [2022-04-15 11:37:57,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-15 11:37:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 11:37:57,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:57,675 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:37:57,676 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:37:57,676 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:57,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2086075870, now seen corresponding path program 1 times [2022-04-15 11:37:57,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:57,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1242703211] [2022-04-15 11:37:57,709 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:37:57,709 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:37:57,709 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:57,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2086075870, now seen corresponding path program 2 times [2022-04-15 11:37:57,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:57,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245358658] [2022-04-15 11:37:57,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:57,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:57,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:57,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {5705#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {5698#true} is VALID [2022-04-15 11:37:57,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {5698#true} assume true; {5698#true} is VALID [2022-04-15 11:37:57,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5698#true} {5698#true} #664#return; {5698#true} is VALID [2022-04-15 11:37:57,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {5698#true} call ULTIMATE.init(); {5705#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:37:57,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {5705#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {5698#true} is VALID [2022-04-15 11:37:57,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {5698#true} assume true; {5698#true} is VALID [2022-04-15 11:37:57,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5698#true} {5698#true} #664#return; {5698#true} is VALID [2022-04-15 11:37:57,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {5698#true} call #t~ret162 := main(); {5698#true} is VALID [2022-04-15 11:37:57,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {5698#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5698#true} is VALID [2022-04-15 11:37:57,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {5698#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5698#true} is VALID [2022-04-15 11:37:57,860 INFO L272 TraceCheckUtils]: 7: Hoare triple {5698#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5698#true} is VALID [2022-04-15 11:37:57,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {5698#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:57,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:57,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:57,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {5703#(= 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)))); {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:57,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:57,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:57,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:37:57,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {5704#(= 8464 |ssl3_accept_#t~mem42|)} is VALID [2022-04-15 11:37:57,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {5704#(= 8464 |ssl3_accept_#t~mem42|)} assume 12292 == #t~mem42;havoc #t~mem42; {5699#false} is VALID [2022-04-15 11:37:57,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {5699#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {5699#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {5699#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {5699#false} is VALID [2022-04-15 11:37:57,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {5699#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {5699#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {5699#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {5699#false} is VALID [2022-04-15 11:37:57,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {5699#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {5699#false} is VALID [2022-04-15 11:37:57,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {5699#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {5699#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {5699#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {5699#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {5699#false} is VALID [2022-04-15 11:37:57,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {5699#false} ~skip~0 := 0; {5699#false} is VALID [2022-04-15 11:37:57,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {5699#false} assume !false; {5699#false} is VALID [2022-04-15 11:37:57,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {5699#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {5699#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {5699#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {5699#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {5699#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {5699#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {5699#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {5699#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {5699#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {5699#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {5699#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {5699#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {5699#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {5699#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {5699#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {5699#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {5699#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {5699#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {5699#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {5699#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {5699#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {5699#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {5699#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,874 INFO L290 TraceCheckUtils]: 53: Hoare triple {5699#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,874 INFO L290 TraceCheckUtils]: 54: Hoare triple {5699#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,874 INFO L290 TraceCheckUtils]: 55: Hoare triple {5699#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,874 INFO L290 TraceCheckUtils]: 56: Hoare triple {5699#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,874 INFO L290 TraceCheckUtils]: 57: Hoare triple {5699#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {5699#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,874 INFO L290 TraceCheckUtils]: 59: Hoare triple {5699#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,875 INFO L290 TraceCheckUtils]: 60: Hoare triple {5699#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,875 INFO L290 TraceCheckUtils]: 61: Hoare triple {5699#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,875 INFO L290 TraceCheckUtils]: 62: Hoare triple {5699#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-15 11:37:57,875 INFO L290 TraceCheckUtils]: 63: Hoare triple {5699#false} assume 8672 == #t~mem74;havoc #t~mem74; {5699#false} is VALID [2022-04-15 11:37:57,875 INFO L290 TraceCheckUtils]: 64: Hoare triple {5699#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {5699#false} is VALID [2022-04-15 11:37:57,875 INFO L290 TraceCheckUtils]: 65: Hoare triple {5699#false} assume 4 == ~blastFlag~0; {5699#false} is VALID [2022-04-15 11:37:57,875 INFO L290 TraceCheckUtils]: 66: Hoare triple {5699#false} assume !false; {5699#false} is VALID [2022-04-15 11:37:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:37:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:57,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245358658] [2022-04-15 11:37:57,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245358658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:57,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:57,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:57,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:57,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1242703211] [2022-04-15 11:37:57,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1242703211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:57,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:57,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:57,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417380191] [2022-04-15 11:37:57,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:57,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 11:37:57,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:57,881 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-15 11:37:57,934 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-15 11:37:57,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:37:57,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:57,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:37:57,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:37:57,935 INFO L87 Difference]: Start difference. First operand 167 states and 252 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-15 11:37:59,955 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-15 11:38:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:01,037 INFO L93 Difference]: Finished difference Result 321 states and 486 transitions. [2022-04-15 11:38:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:38:01,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 11:38:01,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:01,038 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-15 11:38:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-15 11:38:01,042 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-15 11:38:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-15 11:38:01,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 430 transitions. [2022-04-15 11:38:01,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:01,397 INFO L225 Difference]: With dead ends: 321 [2022-04-15 11:38:01,397 INFO L226 Difference]: Without dead ends: 180 [2022-04-15 11:38:01,398 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-15 11:38:01,398 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 26 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:01,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:38:01,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-15 11:38:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2022-04-15 11:38:01,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:01,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 167 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 162 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:01,408 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 167 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 162 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:01,409 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 167 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 162 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:01,412 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-15 11:38:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-15 11:38:01,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:01,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:01,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 162 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-15 11:38:01,414 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 162 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-15 11:38:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:01,426 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-15 11:38:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-15 11:38:01,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:01,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:01,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:01,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 162 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 251 transitions. [2022-04-15 11:38:01,431 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 251 transitions. Word has length 67 [2022-04-15 11:38:01,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:01,431 INFO L478 AbstractCegarLoop]: Abstraction has 167 states and 251 transitions. [2022-04-15 11:38:01,431 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-15 11:38:01,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 251 transitions. [2022-04-15 11:38:01,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 251 transitions. [2022-04-15 11:38:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 11:38:01,617 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:01,618 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:01,618 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:38:01,618 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:01,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:01,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1877545714, now seen corresponding path program 1 times [2022-04-15 11:38:01,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:01,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [251810364] [2022-04-15 11:38:01,824 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-15 11:38:01,825 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:38:01,826 INFO L85 PathProgramCache]: Analyzing trace with hash 809606660, now seen corresponding path program 1 times [2022-04-15 11:38:01,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:01,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927262079] [2022-04-15 11:38:01,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:01,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:01,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:01,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {7052#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {7046#true} is VALID [2022-04-15 11:38:01,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {7046#true} assume true; {7046#true} is VALID [2022-04-15 11:38:01,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7046#true} {7046#true} #664#return; {7046#true} is VALID [2022-04-15 11:38:01,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {7046#true} call ULTIMATE.init(); {7052#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:38:01,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {7052#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {7046#true} is VALID [2022-04-15 11:38:01,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {7046#true} assume true; {7046#true} is VALID [2022-04-15 11:38:01,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7046#true} {7046#true} #664#return; {7046#true} is VALID [2022-04-15 11:38:01,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {7046#true} call #t~ret162 := main(); {7046#true} is VALID [2022-04-15 11:38:01,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {7046#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7046#true} is VALID [2022-04-15 11:38:01,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {7046#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {7046#true} is VALID [2022-04-15 11:38:01,952 INFO L272 TraceCheckUtils]: 7: Hoare triple {7046#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7046#true} is VALID [2022-04-15 11:38:01,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {7046#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} [670] L1166-2-->L1167_primed: Formula: (let ((.cse0 (= |v_#memory_$Pointer$.base_283| |v_#memory_$Pointer$.base_277|)) (.cse1 (= |v_ssl3_accept_#t~mem42_16| |v_ssl3_accept_#t~mem42_14|)) (.cse2 (= |v_ssl3_accept_#t~mem43_14| |v_ssl3_accept_#t~mem43_12|)) (.cse3 (= |v_ssl3_accept_#t~mem85.base_5| |v_ssl3_accept_#t~mem85.base_4|)) (.cse4 (= |v_ssl3_accept_#t~mem81_10| |v_ssl3_accept_#t~mem81_8|)) (.cse5 (= |v_ssl3_accept_#t~mem85.offset_5| |v_ssl3_accept_#t~mem85.offset_4|)) (.cse6 (= |v_ssl3_accept_#t~mem152_16| |v_ssl3_accept_#t~mem152_14|)) (.cse7 (= v_ssl3_accept_~skip~0_18 v_ssl3_accept_~skip~0_17)) (.cse8 (= |v_ssl3_accept_#t~mem151.offset_14| |v_ssl3_accept_#t~mem151.offset_12|)) (.cse9 (= |v_ssl3_accept_#t~mem151.base_14| |v_ssl3_accept_#t~mem151.base_12|)) (.cse10 (= |v_ssl3_accept_#t~nondet80_7| |v_ssl3_accept_#t~nondet80_5|)) (.cse11 (= |v_ssl3_accept_#t~mem78.base_10| |v_ssl3_accept_#t~mem78.base_8|)) (.cse12 (= |v_ssl3_accept_#t~mem41_8| |v_ssl3_accept_#t~mem41_7|)) (.cse13 (= |v_ssl3_accept_#t~mem77_10| |v_ssl3_accept_#t~mem77_8|)) (.cse14 (= |v_#memory_$Pointer$.offset_283| |v_#memory_$Pointer$.offset_277|)) (.cse15 (= |v_ssl3_accept_#t~mem86_5| |v_ssl3_accept_#t~mem86_4|)) (.cse16 (= v_ssl3_accept_~tmp___4~0_7 v_ssl3_accept_~tmp___4~0_6))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_ssl3_accept_#t~mem78.offset_8| |v_ssl3_accept_#t~mem78.offset_10|) .cse9 (= |v_#memory_int_268| |v_#memory_int_273|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= v_ssl3_accept_~state~0_9 v_ssl3_accept_~state~0_10) .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= v_ssl3_accept_~state~0_10 v_ssl3_accept_~state~0_9) .cse9 (= |v_#memory_int_273| |v_#memory_int_268|) .cse10 .cse11 .cse12 .cse13 .cse14 (= |v_ssl3_accept_#t~mem78.offset_10| |v_ssl3_accept_#t~mem78.offset_8|) .cse15 .cse16))) InVars {ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_10|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_283|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_10|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_8|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_14|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_7, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_5|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_7|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_10|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_18, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_14|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_16|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_14|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_16|, #memory_int=|v_#memory_int_273|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_5|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_283|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_10, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_5|} OutVars{ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_277|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_8|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_7|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_12|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_6, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_4|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_5|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_8|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_17, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_12|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_14|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_12|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_14|, #memory_int=|v_#memory_int_268|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_4|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_8|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_277|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_9, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_4|} AuxVars[] AssignedVars[ssl3_accept_#t~mem81, #memory_$Pointer$.base, ssl3_accept_#t~mem78.base, ssl3_accept_#t~mem41, ssl3_accept_#t~mem151.base, ssl3_accept_~tmp___4~0, ssl3_accept_#t~mem85.base, ssl3_accept_#t~nondet80, ssl3_accept_#t~mem78.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem43, ssl3_accept_#t~mem42, ssl3_accept_#t~mem151.offset, ssl3_accept_#t~mem152, #memory_int, ssl3_accept_#t~mem86, ssl3_accept_#t~mem77, #memory_$Pointer$.offset, ssl3_accept_~state~0, ssl3_accept_#t~mem85.offset] {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} [669] L1167_primed-->L1167: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,971 INFO L290 TraceCheckUtils]: 40: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,972 INFO L290 TraceCheckUtils]: 41: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,972 INFO L290 TraceCheckUtils]: 42: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,972 INFO L290 TraceCheckUtils]: 43: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,973 INFO L290 TraceCheckUtils]: 44: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,973 INFO L290 TraceCheckUtils]: 45: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,974 INFO L290 TraceCheckUtils]: 47: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,974 INFO L290 TraceCheckUtils]: 48: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,977 INFO L290 TraceCheckUtils]: 49: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem74;havoc #t~mem74; {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:01,978 INFO L290 TraceCheckUtils]: 51: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {7047#false} is VALID [2022-04-15 11:38:01,978 INFO L290 TraceCheckUtils]: 52: Hoare triple {7047#false} assume !false; {7047#false} is VALID [2022-04-15 11:38:01,979 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-15 11:38:01,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:01,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927262079] [2022-04-15 11:38:01,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927262079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:01,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:01,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:38:06,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:06,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [251810364] [2022-04-15 11:38:06,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [251810364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:06,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:06,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:38:06,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830405971] [2022-04-15 11:38:06,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:06,130 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 11:38:06,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:06,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:06,198 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-15 11:38:06,199 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:38:06,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:06,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:38:06,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=125, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:38:06,200 INFO L87 Difference]: Start difference. First operand 167 states and 251 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:08,233 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-15 11:38:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:09,752 INFO L93 Difference]: Finished difference Result 319 states and 482 transitions. [2022-04-15 11:38:09,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:38:09,753 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 11:38:09,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 426 transitions. [2022-04-15 11:38:09,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 426 transitions. [2022-04-15 11:38:09,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 426 transitions. [2022-04-15 11:38:10,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 426 edges. 426 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:10,072 INFO L225 Difference]: With dead ends: 319 [2022-04-15 11:38:10,073 INFO L226 Difference]: Without dead ends: 178 [2022-04-15 11:38:10,073 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=56, Invalid=125, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:38:10,074 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 13 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:10,074 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 563 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 424 Invalid, 1 Unknown, 133 Unchecked, 2.5s Time] [2022-04-15 11:38:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-15 11:38:10,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2022-04-15 11:38:10,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:10,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:10,099 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:10,099 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:10,103 INFO L93 Difference]: Finished difference Result 178 states and 264 transitions. [2022-04-15 11:38:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 264 transitions. [2022-04-15 11:38:10,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:10,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:10,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 3 states have call successors, (3), 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 178 states. [2022-04-15 11:38:10,104 INFO L87 Difference]: Start difference. First operand has 175 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 3 states have call successors, (3), 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 178 states. [2022-04-15 11:38:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:10,108 INFO L93 Difference]: Finished difference Result 178 states and 264 transitions. [2022-04-15 11:38:10,108 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 264 transitions. [2022-04-15 11:38:10,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:10,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:10,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:10,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 261 transitions. [2022-04-15 11:38:10,113 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 261 transitions. Word has length 67 [2022-04-15 11:38:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:10,114 INFO L478 AbstractCegarLoop]: Abstraction has 175 states and 261 transitions. [2022-04-15 11:38:10,114 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:10,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 261 transitions. [2022-04-15 11:38:10,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 261 transitions. [2022-04-15 11:38:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 11:38:10,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:10,323 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:10,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:38:10,323 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:10,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:10,324 INFO L85 PathProgramCache]: Analyzing trace with hash 61616332, now seen corresponding path program 1 times [2022-04-15 11:38:10,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:10,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [840006879] [2022-04-15 11:38:10,502 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-15 11:38:10,503 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:38:10,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2065119804, now seen corresponding path program 1 times [2022-04-15 11:38:10,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:10,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202913149] [2022-04-15 11:38:10,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:10,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:10,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:10,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {8415#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {8409#true} is VALID [2022-04-15 11:38:10,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {8409#true} assume true; {8409#true} is VALID [2022-04-15 11:38:10,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8409#true} {8409#true} #664#return; {8409#true} is VALID [2022-04-15 11:38:10,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {8409#true} call ULTIMATE.init(); {8415#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:38:10,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {8415#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {8409#true} is VALID [2022-04-15 11:38:10,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {8409#true} assume true; {8409#true} is VALID [2022-04-15 11:38:10,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8409#true} {8409#true} #664#return; {8409#true} is VALID [2022-04-15 11:38:10,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {8409#true} call #t~ret162 := main(); {8409#true} is VALID [2022-04-15 11:38:10,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {8409#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {8409#true} is VALID [2022-04-15 11:38:10,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {8409#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8409#true} is VALID [2022-04-15 11:38:10,658 INFO L272 TraceCheckUtils]: 7: Hoare triple {8409#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8409#true} is VALID [2022-04-15 11:38:10,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {8409#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} [672] L1166-2-->L1167_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem152_22| |v_ssl3_accept_#t~mem152_20|)) (.cse1 (= |v_ssl3_accept_#t~mem42_23| |v_ssl3_accept_#t~mem42_21|)) (.cse2 (= |v_ssl3_accept_#t~mem77_17| |v_ssl3_accept_#t~mem77_15|)) (.cse3 (= |v_ssl3_accept_#t~mem85.base_10| |v_ssl3_accept_#t~mem85.base_9|)) (.cse4 (= |v_ssl3_accept_#t~nondet80_14| |v_ssl3_accept_#t~nondet80_12|)) (.cse5 (= |v_#memory_$Pointer$.offset_303| |v_#memory_$Pointer$.offset_297|)) (.cse6 (= |v_ssl3_accept_#t~mem43_21| |v_ssl3_accept_#t~mem43_19|)) (.cse7 (= |v_#memory_$Pointer$.base_303| |v_#memory_$Pointer$.base_297|)) (.cse8 (= v_ssl3_accept_~state~0_15 v_ssl3_accept_~state~0_14)) (.cse9 (= |v_ssl3_accept_#t~mem86_10| |v_ssl3_accept_#t~mem86_9|)) (.cse10 (= |v_ssl3_accept_#t~mem78.base_17| |v_ssl3_accept_#t~mem78.base_15|)) (.cse11 (= |v_ssl3_accept_#t~mem81_17| |v_ssl3_accept_#t~mem81_15|)) (.cse12 (= |v_ssl3_accept_#t~mem78.offset_17| |v_ssl3_accept_#t~mem78.offset_15|)) (.cse13 (= |v_ssl3_accept_#t~mem41_13| |v_ssl3_accept_#t~mem41_12|)) (.cse14 (= v_ssl3_accept_~skip~0_23 v_ssl3_accept_~skip~0_22)) (.cse15 (= v_ssl3_accept_~tmp___4~0_12 v_ssl3_accept_~tmp___4~0_11))) (or (and .cse0 .cse1 (= |v_#memory_int_292| |v_#memory_int_287|) .cse2 .cse3 (= |v_ssl3_accept_#t~mem85.offset_10| |v_ssl3_accept_#t~mem85.offset_9|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_ssl3_accept_#t~mem151.offset_20| |v_ssl3_accept_#t~mem151.offset_18|) .cse10 .cse11 (= |v_ssl3_accept_#t~mem151.base_20| |v_ssl3_accept_#t~mem151.base_18|) .cse12 .cse13 .cse14 .cse15) (and (= |v_ssl3_accept_#t~mem151.offset_18| |v_ssl3_accept_#t~mem151.offset_20|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_#memory_int_287| |v_#memory_int_292|) .cse10 (= |v_ssl3_accept_#t~mem85.offset_9| |v_ssl3_accept_#t~mem85.offset_10|) .cse11 .cse12 .cse13 (= |v_ssl3_accept_#t~mem151.base_18| |v_ssl3_accept_#t~mem151.base_20|) .cse14 .cse15))) InVars {ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_303|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_17|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_13|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_20|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_12, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_10|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_14|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_17|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_23, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_21|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_23|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_20|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_22|, #memory_int=|v_#memory_int_292|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_10|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_17|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_303|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_15, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_10|} OutVars{ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_15|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_297|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_15|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_12|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_18|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_11, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_9|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_12|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_15|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_22, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_19|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_21|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_18|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_20|, #memory_int=|v_#memory_int_287|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_9|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_297|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_14, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_9|} AuxVars[] AssignedVars[ssl3_accept_#t~mem81, #memory_$Pointer$.base, ssl3_accept_#t~mem78.base, ssl3_accept_#t~mem41, ssl3_accept_#t~mem151.base, ssl3_accept_~tmp___4~0, ssl3_accept_#t~mem85.base, ssl3_accept_#t~nondet80, ssl3_accept_#t~mem78.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem43, ssl3_accept_#t~mem42, ssl3_accept_#t~mem151.offset, ssl3_accept_#t~mem152, #memory_int, ssl3_accept_#t~mem86, ssl3_accept_#t~mem77, #memory_$Pointer$.offset, ssl3_accept_~state~0, ssl3_accept_#t~mem85.offset] {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} [671] L1167_primed-->L1167: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,673 INFO L290 TraceCheckUtils]: 43: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,674 INFO L290 TraceCheckUtils]: 47: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem74;havoc #t~mem74; {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,675 INFO L290 TraceCheckUtils]: 50: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:10,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {8410#false} is VALID [2022-04-15 11:38:10,676 INFO L290 TraceCheckUtils]: 52: Hoare triple {8410#false} assume !false; {8410#false} is VALID [2022-04-15 11:38:10,676 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-15 11:38:10,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:10,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202913149] [2022-04-15 11:38:10,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202913149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:10,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:10,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:38:13,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:13,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [840006879] [2022-04-15 11:38:13,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [840006879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:13,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:13,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:38:13,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002753823] [2022-04-15 11:38:13,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:13,911 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 11:38:13,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:13,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:13,984 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-15 11:38:13,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:38:13,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:13,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:38:13,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=125, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:38:13,985 INFO L87 Difference]: Start difference. First operand 175 states and 261 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:16,011 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-15 11:38:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:17,057 INFO L93 Difference]: Finished difference Result 327 states and 493 transitions. [2022-04-15 11:38:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:38:17,057 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 11:38:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 431 transitions. [2022-04-15 11:38:17,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 431 transitions. [2022-04-15 11:38:17,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 431 transitions. [2022-04-15 11:38:17,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 431 edges. 431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:17,426 INFO L225 Difference]: With dead ends: 327 [2022-04-15 11:38:17,426 INFO L226 Difference]: Without dead ends: 186 [2022-04-15 11:38:17,427 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=56, Invalid=125, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:38:17,427 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 17 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:17,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 522 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 266 Invalid, 1 Unknown, 150 Unchecked, 2.3s Time] [2022-04-15 11:38:17,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-15 11:38:17,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 177. [2022-04-15 11:38:17,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:17,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 177 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:17,448 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 177 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:17,449 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 177 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:17,454 INFO L93 Difference]: Finished difference Result 186 states and 274 transitions. [2022-04-15 11:38:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 274 transitions. [2022-04-15 11:38:17,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:17,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:17,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-15 11:38:17,455 INFO L87 Difference]: Start difference. First operand has 177 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-15 11:38:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:17,459 INFO L93 Difference]: Finished difference Result 186 states and 274 transitions. [2022-04-15 11:38:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 274 transitions. [2022-04-15 11:38:17,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:17,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:17,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:17,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 263 transitions. [2022-04-15 11:38:17,465 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 263 transitions. Word has length 67 [2022-04-15 11:38:17,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:17,465 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 263 transitions. [2022-04-15 11:38:17,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:17,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 263 transitions. [2022-04-15 11:38:17,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2022-04-15 11:38:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 11:38:17,755 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:17,755 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:17,755 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:38:17,755 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:17,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:17,756 INFO L85 PathProgramCache]: Analyzing trace with hash -957475682, now seen corresponding path program 1 times [2022-04-15 11:38:17,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:17,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1248743624] [2022-04-15 11:38:17,779 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:38:17,779 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:38:17,779 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:38:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash -957475682, now seen corresponding path program 2 times [2022-04-15 11:38:17,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:17,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030545777] [2022-04-15 11:38:17,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:17,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:17,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:17,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {9815#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {9808#true} is VALID [2022-04-15 11:38:17,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {9808#true} assume true; {9808#true} is VALID [2022-04-15 11:38:17,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9808#true} {9808#true} #664#return; {9808#true} is VALID [2022-04-15 11:38:17,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {9808#true} call ULTIMATE.init(); {9815#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:38:17,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {9815#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {9808#true} is VALID [2022-04-15 11:38:17,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {9808#true} assume true; {9808#true} is VALID [2022-04-15 11:38:17,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9808#true} {9808#true} #664#return; {9808#true} is VALID [2022-04-15 11:38:17,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {9808#true} call #t~ret162 := main(); {9808#true} is VALID [2022-04-15 11:38:17,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {9808#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9808#true} is VALID [2022-04-15 11:38:17,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {9808#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9808#true} is VALID [2022-04-15 11:38:17,924 INFO L272 TraceCheckUtils]: 7: Hoare triple {9808#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9808#true} is VALID [2022-04-15 11:38:17,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {9808#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:17,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:17,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:17,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {9813#(= 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)))); {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:17,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:17,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:17,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:17,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:17,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {9813#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9814#(= 8464 |ssl3_accept_#t~mem43|)} is VALID [2022-04-15 11:38:17,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {9814#(= 8464 |ssl3_accept_#t~mem43|)} assume 16384 == #t~mem43;havoc #t~mem43; {9809#false} is VALID [2022-04-15 11:38:17,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {9809#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {9809#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9809#false} is VALID [2022-04-15 11:38:17,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {9809#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {9809#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {9809#false} assume 0 == (#t~mem78.base + #t~mem78.offset) % 4294967296;havoc #t~mem78.base, #t~mem78.offset;assume -2147483648 <= #t~nondet79 && #t~nondet79 <= 2147483647;~tmp___3~0 := #t~nondet79;havoc #t~nondet79; {9809#false} is VALID [2022-04-15 11:38:17,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {9809#false} assume !(0 == ~tmp___3~0);call write~$Pointer$(~buf~0.base, ~buf~0.offset, ~s.base, 60 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {9809#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {9809#false} is VALID [2022-04-15 11:38:17,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {9809#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {9809#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {9809#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {9809#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {9809#false} is VALID [2022-04-15 11:38:17,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {9809#false} ~skip~0 := 0; {9809#false} is VALID [2022-04-15 11:38:17,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {9809#false} assume !false; {9809#false} is VALID [2022-04-15 11:38:17,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {9809#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {9809#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {9809#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {9809#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {9809#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {9809#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {9809#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {9809#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {9809#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {9809#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,936 INFO L290 TraceCheckUtils]: 41: Hoare triple {9809#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {9809#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {9809#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {9809#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {9809#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,936 INFO L290 TraceCheckUtils]: 46: Hoare triple {9809#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,937 INFO L290 TraceCheckUtils]: 47: Hoare triple {9809#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {9809#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {9809#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {9809#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,941 INFO L290 TraceCheckUtils]: 51: Hoare triple {9809#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,941 INFO L290 TraceCheckUtils]: 52: Hoare triple {9809#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,941 INFO L290 TraceCheckUtils]: 53: Hoare triple {9809#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,941 INFO L290 TraceCheckUtils]: 54: Hoare triple {9809#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,941 INFO L290 TraceCheckUtils]: 55: Hoare triple {9809#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,941 INFO L290 TraceCheckUtils]: 56: Hoare triple {9809#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,941 INFO L290 TraceCheckUtils]: 57: Hoare triple {9809#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,942 INFO L290 TraceCheckUtils]: 58: Hoare triple {9809#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,942 INFO L290 TraceCheckUtils]: 59: Hoare triple {9809#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,942 INFO L290 TraceCheckUtils]: 60: Hoare triple {9809#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,942 INFO L290 TraceCheckUtils]: 61: Hoare triple {9809#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,942 INFO L290 TraceCheckUtils]: 62: Hoare triple {9809#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,942 INFO L290 TraceCheckUtils]: 63: Hoare triple {9809#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-15 11:38:17,942 INFO L290 TraceCheckUtils]: 64: Hoare triple {9809#false} assume 8672 == #t~mem74;havoc #t~mem74; {9809#false} is VALID [2022-04-15 11:38:17,942 INFO L290 TraceCheckUtils]: 65: Hoare triple {9809#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {9809#false} is VALID [2022-04-15 11:38:17,942 INFO L290 TraceCheckUtils]: 66: Hoare triple {9809#false} assume 4 == ~blastFlag~0; {9809#false} is VALID [2022-04-15 11:38:17,942 INFO L290 TraceCheckUtils]: 67: Hoare triple {9809#false} assume !false; {9809#false} is VALID [2022-04-15 11:38:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:38:17,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:17,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030545777] [2022-04-15 11:38:17,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030545777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:17,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:17,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:17,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:17,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1248743624] [2022-04-15 11:38:17,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1248743624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:17,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:17,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:17,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971172104] [2022-04-15 11:38:17,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:17,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:38:17,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:17,945 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-15 11:38:18,008 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-15 11:38:18,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:38:18,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:18,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:38:18,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:38:18,010 INFO L87 Difference]: Start difference. First operand 177 states and 263 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-15 11:38:20,042 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-15 11:38:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:21,190 INFO L93 Difference]: Finished difference Result 329 states and 494 transitions. [2022-04-15 11:38:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:38:21,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:38:21,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:21,191 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-15 11:38:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-15 11:38:21,194 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-15 11:38:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-15 11:38:21,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 428 transitions. [2022-04-15 11:38:21,549 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-15 11:38:21,552 INFO L225 Difference]: With dead ends: 329 [2022-04-15 11:38:21,552 INFO L226 Difference]: Without dead ends: 180 [2022-04-15 11:38:21,553 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-15 11:38:21,553 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 23 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:21,554 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:38:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-15 11:38:21,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 169. [2022-04-15 11:38:21,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:21,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 169 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 164 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:21,560 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 169 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 164 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:21,561 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 169 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 164 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:21,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:21,565 INFO L93 Difference]: Finished difference Result 180 states and 266 transitions. [2022-04-15 11:38:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 266 transitions. [2022-04-15 11:38:21,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:21,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:21,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 164 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-15 11:38:21,575 INFO L87 Difference]: Start difference. First operand has 169 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 164 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-15 11:38:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:21,579 INFO L93 Difference]: Finished difference Result 180 states and 266 transitions. [2022-04-15 11:38:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 266 transitions. [2022-04-15 11:38:21,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:21,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:21,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:21,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:21,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 164 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2022-04-15 11:38:21,583 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 252 transitions. Word has length 68 [2022-04-15 11:38:21,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:21,584 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 252 transitions. [2022-04-15 11:38:21,584 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-15 11:38:21,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 252 transitions. [2022-04-15 11:38:21,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 252 transitions. [2022-04-15 11:38:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 11:38:21,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:21,827 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:21,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:38:21,827 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:21,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:21,828 INFO L85 PathProgramCache]: Analyzing trace with hash -175906935, now seen corresponding path program 1 times [2022-04-15 11:38:21,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:21,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [267673341] [2022-04-15 11:38:21,993 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-15 11:38:21,993 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:38:21,994 INFO L85 PathProgramCache]: Analyzing trace with hash -644878972, now seen corresponding path program 1 times [2022-04-15 11:38:21,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:21,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305573970] [2022-04-15 11:38:21,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:21,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:22,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:22,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {11182#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {11176#true} is VALID [2022-04-15 11:38:22,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {11176#true} assume true; {11176#true} is VALID [2022-04-15 11:38:22,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11176#true} {11176#true} #664#return; {11176#true} is VALID [2022-04-15 11:38:22,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {11176#true} call ULTIMATE.init(); {11182#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:38:22,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {11182#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {11176#true} is VALID [2022-04-15 11:38:22,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {11176#true} assume true; {11176#true} is VALID [2022-04-15 11:38:22,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11176#true} {11176#true} #664#return; {11176#true} is VALID [2022-04-15 11:38:22,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {11176#true} call #t~ret162 := main(); {11176#true} is VALID [2022-04-15 11:38:22,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {11176#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {11176#true} is VALID [2022-04-15 11:38:22,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {11176#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {11176#true} is VALID [2022-04-15 11:38:22,151 INFO L272 TraceCheckUtils]: 7: Hoare triple {11176#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11176#true} is VALID [2022-04-15 11:38:22,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {11176#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} [674] L1166-2-->L1167_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem44_14| |v_ssl3_accept_#t~mem44_12|)) (.cse1 (= |v_ssl3_accept_#t~mem81_26| |v_ssl3_accept_#t~mem81_24|)) (.cse2 (= v_ssl3_accept_~tmp___4~0_18 v_ssl3_accept_~tmp___4~0_17)) (.cse3 (= |v_ssl3_accept_#t~mem78.offset_26| |v_ssl3_accept_#t~mem78.offset_24|)) (.cse4 (= v_ssl3_accept_~skip~0_29 v_ssl3_accept_~skip~0_28)) (.cse5 (= |v_#memory_$Pointer$.offset_345| |v_#memory_$Pointer$.offset_339|)) (.cse6 (= |v_ssl3_accept_#t~mem85.base_16| |v_ssl3_accept_#t~mem85.base_15|)) (.cse7 (= |v_#memory_$Pointer$.base_345| |v_#memory_$Pointer$.base_339|)) (.cse8 (= |v_ssl3_accept_#t~mem78.base_26| |v_ssl3_accept_#t~mem78.base_24|)) (.cse9 (= |v_ssl3_accept_#t~nondet80_23| |v_ssl3_accept_#t~nondet80_21|)) (.cse10 (= v_ssl3_accept_~state~0_21 v_ssl3_accept_~state~0_20)) (.cse11 (= |v_ssl3_accept_#t~mem151.base_28| |v_ssl3_accept_#t~mem151.base_26|)) (.cse12 (= |v_ssl3_accept_#t~mem86_16| |v_ssl3_accept_#t~mem86_15|)) (.cse13 (= |v_ssl3_accept_#t~mem41_19| |v_ssl3_accept_#t~mem41_18|)) (.cse14 (= |v_ssl3_accept_#t~mem77_26| |v_ssl3_accept_#t~mem77_24|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_#memory_int_320| |v_#memory_int_325|) .cse6 (= |v_ssl3_accept_#t~mem85.offset_15| |v_ssl3_accept_#t~mem85.offset_16|) (= |v_ssl3_accept_#t~mem152_28| |v_ssl3_accept_#t~mem152_30|) (= |v_ssl3_accept_#t~mem151.offset_26| |v_ssl3_accept_#t~mem151.offset_28|) .cse7 (= |v_ssl3_accept_#t~mem42_30| |v_ssl3_accept_#t~mem42_32|) .cse8 .cse9 (= |v_ssl3_accept_#t~mem43_28| |v_ssl3_accept_#t~mem43_30|) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (= |v_#memory_int_325| |v_#memory_int_320|) (= |v_ssl3_accept_#t~mem42_32| |v_ssl3_accept_#t~mem42_30|) .cse1 .cse2 .cse3 .cse4 (= |v_ssl3_accept_#t~mem152_30| |v_ssl3_accept_#t~mem152_28|) .cse5 .cse6 (= |v_ssl3_accept_#t~mem85.offset_16| |v_ssl3_accept_#t~mem85.offset_15|) .cse7 .cse8 .cse9 (= |v_ssl3_accept_#t~mem151.offset_28| |v_ssl3_accept_#t~mem151.offset_26|) .cse10 .cse11 .cse12 .cse13 .cse14 (= |v_ssl3_accept_#t~mem43_30| |v_ssl3_accept_#t~mem43_28|)))) InVars {ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_345|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_26|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_19|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_28|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_18, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_16|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_23|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_26|, ssl3_accept_#t~mem44=|v_ssl3_accept_#t~mem44_14|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_29, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_30|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_32|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_30|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_28|, #memory_int=|v_#memory_int_325|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_16|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_26|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_345|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_21, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_16|} OutVars{ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_339|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_24|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_18|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_26|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_17, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_15|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_21|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_24|, ssl3_accept_#t~mem44=|v_ssl3_accept_#t~mem44_12|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_28, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_28|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_30|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_28|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_26|, #memory_int=|v_#memory_int_320|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_15|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_339|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_20, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_15|} AuxVars[] AssignedVars[ssl3_accept_#t~mem81, #memory_$Pointer$.base, ssl3_accept_#t~mem78.base, ssl3_accept_#t~mem41, ssl3_accept_#t~mem151.base, ssl3_accept_~tmp___4~0, ssl3_accept_#t~mem85.base, ssl3_accept_#t~nondet80, ssl3_accept_#t~mem78.offset, ssl3_accept_#t~mem44, ssl3_accept_~skip~0, ssl3_accept_#t~mem43, ssl3_accept_#t~mem42, ssl3_accept_#t~mem152, ssl3_accept_#t~mem151.offset, #memory_int, ssl3_accept_#t~mem86, ssl3_accept_#t~mem77, #memory_$Pointer$.offset, ssl3_accept_~state~0, ssl3_accept_#t~mem85.offset] {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} [673] L1167_primed-->L1167: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,163 INFO L290 TraceCheckUtils]: 42: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,163 INFO L290 TraceCheckUtils]: 44: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,164 INFO L290 TraceCheckUtils]: 45: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,165 INFO L290 TraceCheckUtils]: 48: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem74;havoc #t~mem74; {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,165 INFO L290 TraceCheckUtils]: 50: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {11181#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:22,166 INFO L290 TraceCheckUtils]: 51: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {11177#false} is VALID [2022-04-15 11:38:22,166 INFO L290 TraceCheckUtils]: 52: Hoare triple {11177#false} assume !false; {11177#false} is VALID [2022-04-15 11:38:22,166 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-15 11:38:22,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:22,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305573970] [2022-04-15 11:38:22,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305573970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:22,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:22,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:38:25,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:25,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [267673341] [2022-04-15 11:38:25,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [267673341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:25,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:25,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:38:25,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529209244] [2022-04-15 11:38:25,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:25,854 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:38:25,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:25,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-15 11:38:25,939 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-15 11:38:25,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:38:25,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:25,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:38:25,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=150, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:38:25,941 INFO L87 Difference]: Start difference. First operand 169 states and 252 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-15 11:38:27,996 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-15 11:38:29,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:29,977 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2022-04-15 11:38:29,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 11:38:29,978 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:38:29,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-15 11:38:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 425 transitions. [2022-04-15 11:38:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-15 11:38:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 425 transitions. [2022-04-15 11:38:29,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 425 transitions. [2022-04-15 11:38:30,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:30,313 INFO L225 Difference]: With dead ends: 320 [2022-04-15 11:38:30,313 INFO L226 Difference]: Without dead ends: 179 [2022-04-15 11:38:30,313 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=59, Invalid=150, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:38:30,314 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 12 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:30,314 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 820 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 535 Invalid, 1 Unknown, 253 Unchecked, 2.7s Time] [2022-04-15 11:38:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-15 11:38:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2022-04-15 11:38:30,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:30,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 177 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:30,325 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 177 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:30,326 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 177 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:30,329 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2022-04-15 11:38:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 264 transitions. [2022-04-15 11:38:30,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:30,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:30,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 179 states. [2022-04-15 11:38:30,330 INFO L87 Difference]: Start difference. First operand has 177 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 179 states. [2022-04-15 11:38:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:30,333 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2022-04-15 11:38:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 264 transitions. [2022-04-15 11:38:30,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:30,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:30,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:30,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2022-04-15 11:38:30,338 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 68 [2022-04-15 11:38:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:30,338 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2022-04-15 11:38:30,338 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-15 11:38:30,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 262 transitions. [2022-04-15 11:38:30,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2022-04-15 11:38:30,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 11:38:30,552 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:30,552 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:30,552 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:38:30,552 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:30,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:30,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1763255111, now seen corresponding path program 1 times [2022-04-15 11:38:30,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:30,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1412691823] [2022-04-15 11:38:30,705 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-15 11:38:30,705 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:38:30,705 INFO L85 PathProgramCache]: Analyzing trace with hash 775361860, now seen corresponding path program 1 times [2022-04-15 11:38:30,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:30,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476752638] [2022-04-15 11:38:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:30,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:30,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:30,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {12554#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {12548#true} is VALID [2022-04-15 11:38:30,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {12548#true} assume true; {12548#true} is VALID [2022-04-15 11:38:30,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12548#true} {12548#true} #664#return; {12548#true} is VALID [2022-04-15 11:38:30,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {12548#true} call ULTIMATE.init(); {12554#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:38:30,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {12554#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {12548#true} is VALID [2022-04-15 11:38:30,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {12548#true} assume true; {12548#true} is VALID [2022-04-15 11:38:30,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12548#true} {12548#true} #664#return; {12548#true} is VALID [2022-04-15 11:38:30,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {12548#true} call #t~ret162 := main(); {12548#true} is VALID [2022-04-15 11:38:30,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {12548#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12548#true} is VALID [2022-04-15 11:38:30,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {12548#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12548#true} is VALID [2022-04-15 11:38:30,837 INFO L272 TraceCheckUtils]: 7: Hoare triple {12548#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12548#true} is VALID [2022-04-15 11:38:30,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {12548#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} [676] L1166-2-->L1167_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem151.offset_34| |v_ssl3_accept_#t~mem151.offset_32|)) (.cse1 (= v_ssl3_accept_~tmp___4~0_23 v_ssl3_accept_~tmp___4~0_22)) (.cse2 (= |v_ssl3_accept_#t~mem78.offset_33| |v_ssl3_accept_#t~mem78.offset_31|)) (.cse3 (= |v_#memory_$Pointer$.offset_365| |v_#memory_$Pointer$.offset_359|)) (.cse4 (= |v_ssl3_accept_#t~mem41_24| |v_ssl3_accept_#t~mem41_23|)) (.cse5 (= |v_ssl3_accept_#t~mem81_33| |v_ssl3_accept_#t~mem81_31|)) (.cse6 (= v_ssl3_accept_~state~0_26 v_ssl3_accept_~state~0_25)) (.cse7 (= |v_ssl3_accept_#t~mem85.base_21| |v_ssl3_accept_#t~mem85.base_20|)) (.cse8 (= |v_#memory_$Pointer$.base_365| |v_#memory_$Pointer$.base_359|)) (.cse9 (= |v_ssl3_accept_#t~mem85.offset_21| |v_ssl3_accept_#t~mem85.offset_20|)) (.cse10 (= |v_ssl3_accept_#t~mem152_36| |v_ssl3_accept_#t~mem152_34|)) (.cse11 (= |v_ssl3_accept_#t~mem77_33| |v_ssl3_accept_#t~mem77_31|)) (.cse12 (= |v_ssl3_accept_#t~mem42_39| |v_ssl3_accept_#t~mem42_37|)) (.cse13 (= |v_ssl3_accept_#t~mem43_37| |v_ssl3_accept_#t~mem43_35|)) (.cse14 (= v_ssl3_accept_~skip~0_34 v_ssl3_accept_~skip~0_33)) (.cse15 (= |v_ssl3_accept_#t~mem151.base_34| |v_ssl3_accept_#t~mem151.base_32|))) (or (and .cse0 (= |v_ssl3_accept_#t~mem86_21| |v_ssl3_accept_#t~mem86_20|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_#memory_int_344| |v_#memory_int_339|) .cse9 .cse10 .cse11 .cse12 .cse13 (= |v_ssl3_accept_#t~mem78.base_33| |v_ssl3_accept_#t~mem78.base_31|) (= |v_ssl3_accept_#t~nondet80_30| |v_ssl3_accept_#t~nondet80_28|) (= |v_ssl3_accept_#t~mem44_21| |v_ssl3_accept_#t~mem44_19|) .cse14 .cse15) (and (= |v_ssl3_accept_#t~nondet80_28| |v_ssl3_accept_#t~nondet80_30|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_ssl3_accept_#t~mem78.base_31| |v_ssl3_accept_#t~mem78.base_33|) .cse9 .cse10 .cse11 (= |v_#memory_int_339| |v_#memory_int_344|) .cse12 (= |v_ssl3_accept_#t~mem44_19| |v_ssl3_accept_#t~mem44_21|) .cse13 (= |v_ssl3_accept_#t~mem86_20| |v_ssl3_accept_#t~mem86_21|) .cse14 .cse15))) InVars {ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_33|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_365|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_33|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_24|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_34|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_23, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_21|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_30|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_33|, ssl3_accept_#t~mem44=|v_ssl3_accept_#t~mem44_21|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_34, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_37|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_39|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_36|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_34|, #memory_int=|v_#memory_int_344|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_21|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_365|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_26, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_21|} OutVars{ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_31|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_359|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_31|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_23|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_32|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_22, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_20|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_28|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_31|, ssl3_accept_#t~mem44=|v_ssl3_accept_#t~mem44_19|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_33, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_35|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_37|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_34|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_32|, #memory_int=|v_#memory_int_339|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_20|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_31|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_359|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_25, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_20|} AuxVars[] AssignedVars[ssl3_accept_#t~mem81, #memory_$Pointer$.base, ssl3_accept_#t~mem78.base, ssl3_accept_#t~mem41, ssl3_accept_#t~mem151.base, ssl3_accept_~tmp___4~0, ssl3_accept_#t~mem85.base, ssl3_accept_#t~nondet80, ssl3_accept_#t~mem78.offset, ssl3_accept_#t~mem44, ssl3_accept_~skip~0, ssl3_accept_#t~mem43, ssl3_accept_#t~mem42, ssl3_accept_#t~mem152, ssl3_accept_#t~mem151.offset, #memory_int, ssl3_accept_#t~mem86, ssl3_accept_#t~mem77, #memory_$Pointer$.offset, ssl3_accept_~state~0, ssl3_accept_#t~mem85.offset] {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} [675] L1167_primed-->L1167: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,848 INFO L290 TraceCheckUtils]: 41: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,848 INFO L290 TraceCheckUtils]: 42: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,848 INFO L290 TraceCheckUtils]: 43: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,849 INFO L290 TraceCheckUtils]: 44: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,849 INFO L290 TraceCheckUtils]: 45: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem74;havoc #t~mem74; {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {12553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:30,851 INFO L290 TraceCheckUtils]: 51: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {12549#false} is VALID [2022-04-15 11:38:30,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {12549#false} assume !false; {12549#false} is VALID [2022-04-15 11:38:30,851 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-15 11:38:30,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:30,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476752638] [2022-04-15 11:38:30,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476752638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:30,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:30,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:38:34,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:34,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1412691823] [2022-04-15 11:38:34,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1412691823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:34,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:34,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:38:34,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640316793] [2022-04-15 11:38:34,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:34,585 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:38:34,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:34,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-15 11:38:34,658 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-15 11:38:34,659 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:38:34,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:34,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:38:34,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=150, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:38:34,660 INFO L87 Difference]: Start difference. First operand 177 states and 262 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-15 11:38:36,703 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-15 11:38:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:38,094 INFO L93 Difference]: Finished difference Result 325 states and 488 transitions. [2022-04-15 11:38:38,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 11:38:38,094 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:38:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-15 11:38:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 425 transitions. [2022-04-15 11:38:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-15 11:38:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 425 transitions. [2022-04-15 11:38:38,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 425 transitions. [2022-04-15 11:38:38,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:38,400 INFO L225 Difference]: With dead ends: 325 [2022-04-15 11:38:38,400 INFO L226 Difference]: Without dead ends: 184 [2022-04-15 11:38:38,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=59, Invalid=150, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:38:38,401 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 11 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:38,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 680 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 448 Invalid, 1 Unknown, 143 Unchecked, 2.5s Time] [2022-04-15 11:38:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-15 11:38:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 177. [2022-04-15 11:38:38,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:38,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 177 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:38,413 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 177 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:38,413 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 177 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:38,416 INFO L93 Difference]: Finished difference Result 184 states and 270 transitions. [2022-04-15 11:38:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 270 transitions. [2022-04-15 11:38:38,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:38,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:38,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 184 states. [2022-04-15 11:38:38,417 INFO L87 Difference]: Start difference. First operand has 177 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 184 states. [2022-04-15 11:38:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:38,421 INFO L93 Difference]: Finished difference Result 184 states and 270 transitions. [2022-04-15 11:38:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 270 transitions. [2022-04-15 11:38:38,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:38,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:38,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:38,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2022-04-15 11:38:38,425 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 68 [2022-04-15 11:38:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:38,426 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2022-04-15 11:38:38,426 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-15 11:38:38,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 262 transitions. [2022-04-15 11:38:38,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2022-04-15 11:38:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 11:38:38,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:38,698 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:38,698 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:38:38,698 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:38,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:38,698 INFO L85 PathProgramCache]: Analyzing trace with hash 253718915, now seen corresponding path program 1 times [2022-04-15 11:38:38,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:38,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [709004823] [2022-04-15 11:38:38,722 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:38:38,722 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:38:38,722 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:38:38,722 INFO L85 PathProgramCache]: Analyzing trace with hash 253718915, now seen corresponding path program 2 times [2022-04-15 11:38:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:38,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825088336] [2022-04-15 11:38:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:38,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:38,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {13947#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {13940#true} is VALID [2022-04-15 11:38:38,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {13940#true} assume true; {13940#true} is VALID [2022-04-15 11:38:38,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13940#true} {13940#true} #664#return; {13940#true} is VALID [2022-04-15 11:38:38,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {13940#true} call ULTIMATE.init(); {13947#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:38:38,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {13947#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {13940#true} is VALID [2022-04-15 11:38:38,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {13940#true} assume true; {13940#true} is VALID [2022-04-15 11:38:38,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13940#true} {13940#true} #664#return; {13940#true} is VALID [2022-04-15 11:38:38,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {13940#true} call #t~ret162 := main(); {13940#true} is VALID [2022-04-15 11:38:38,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {13940#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {13940#true} is VALID [2022-04-15 11:38:38,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {13940#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {13940#true} is VALID [2022-04-15 11:38:38,870 INFO L272 TraceCheckUtils]: 7: Hoare triple {13940#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13940#true} is VALID [2022-04-15 11:38:38,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {13940#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:38,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:38,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:38,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {13945#(= 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)))); {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:38,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:38,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:38,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:38,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:38,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:38,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {13945#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {13946#(= 8464 |ssl3_accept_#t~mem44|)} is VALID [2022-04-15 11:38:38,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {13946#(= 8464 |ssl3_accept_#t~mem44|)} assume 8192 == #t~mem44;havoc #t~mem44; {13941#false} is VALID [2022-04-15 11:38:38,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {13941#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {13941#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13941#false} is VALID [2022-04-15 11:38:38,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {13941#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {13941#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {13941#false} assume 0 == (#t~mem78.base + #t~mem78.offset) % 4294967296;havoc #t~mem78.base, #t~mem78.offset;assume -2147483648 <= #t~nondet79 && #t~nondet79 <= 2147483647;~tmp___3~0 := #t~nondet79;havoc #t~nondet79; {13941#false} is VALID [2022-04-15 11:38:38,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {13941#false} assume !(0 == ~tmp___3~0);call write~$Pointer$(~buf~0.base, ~buf~0.offset, ~s.base, 60 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {13941#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {13941#false} is VALID [2022-04-15 11:38:38,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {13941#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {13941#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {13941#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {13941#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {13941#false} is VALID [2022-04-15 11:38:38,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {13941#false} ~skip~0 := 0; {13941#false} is VALID [2022-04-15 11:38:38,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {13941#false} assume !false; {13941#false} is VALID [2022-04-15 11:38:38,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {13941#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {13941#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {13941#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {13941#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {13941#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,878 INFO L290 TraceCheckUtils]: 37: Hoare triple {13941#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {13941#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {13941#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {13941#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,879 INFO L290 TraceCheckUtils]: 41: Hoare triple {13941#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {13941#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {13941#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {13941#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {13941#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,879 INFO L290 TraceCheckUtils]: 46: Hoare triple {13941#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,879 INFO L290 TraceCheckUtils]: 47: Hoare triple {13941#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,879 INFO L290 TraceCheckUtils]: 48: Hoare triple {13941#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,879 INFO L290 TraceCheckUtils]: 49: Hoare triple {13941#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,882 INFO L290 TraceCheckUtils]: 50: Hoare triple {13941#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {13941#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {13941#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,883 INFO L290 TraceCheckUtils]: 53: Hoare triple {13941#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {13941#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,883 INFO L290 TraceCheckUtils]: 55: Hoare triple {13941#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,883 INFO L290 TraceCheckUtils]: 56: Hoare triple {13941#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,883 INFO L290 TraceCheckUtils]: 57: Hoare triple {13941#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {13941#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,883 INFO L290 TraceCheckUtils]: 59: Hoare triple {13941#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,883 INFO L290 TraceCheckUtils]: 60: Hoare triple {13941#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,883 INFO L290 TraceCheckUtils]: 61: Hoare triple {13941#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,884 INFO L290 TraceCheckUtils]: 62: Hoare triple {13941#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,884 INFO L290 TraceCheckUtils]: 63: Hoare triple {13941#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,884 INFO L290 TraceCheckUtils]: 64: Hoare triple {13941#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {13941#false} is VALID [2022-04-15 11:38:38,884 INFO L290 TraceCheckUtils]: 65: Hoare triple {13941#false} assume 8672 == #t~mem74;havoc #t~mem74; {13941#false} is VALID [2022-04-15 11:38:38,884 INFO L290 TraceCheckUtils]: 66: Hoare triple {13941#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {13941#false} is VALID [2022-04-15 11:38:38,884 INFO L290 TraceCheckUtils]: 67: Hoare triple {13941#false} assume 4 == ~blastFlag~0; {13941#false} is VALID [2022-04-15 11:38:38,884 INFO L290 TraceCheckUtils]: 68: Hoare triple {13941#false} assume !false; {13941#false} is VALID [2022-04-15 11:38:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:38:38,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:38,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825088336] [2022-04-15 11:38:38,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825088336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:38,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:38,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:38,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:38,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [709004823] [2022-04-15 11:38:38,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [709004823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:38,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:38,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:38,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633512841] [2022-04-15 11:38:38,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:38,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:38:38,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:38,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:38,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:38,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:38:38,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:38,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:38:38,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:38:38,949 INFO L87 Difference]: Start difference. First operand 177 states and 262 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:40,978 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-15 11:38:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:41,986 INFO L93 Difference]: Finished difference Result 329 states and 493 transitions. [2022-04-15 11:38:41,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:38:41,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:38:41,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-15 11:38:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-15 11:38:41,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-15 11:38:42,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:42,311 INFO L225 Difference]: With dead ends: 329 [2022-04-15 11:38:42,311 INFO L226 Difference]: Without dead ends: 180 [2022-04-15 11:38:42,311 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-15 11:38:42,312 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 21 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:42,312 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:38:42,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-15 11:38:42,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 169. [2022-04-15 11:38:42,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:42,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 169 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:42,318 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 169 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:42,318 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 169 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:42,321 INFO L93 Difference]: Finished difference Result 180 states and 265 transitions. [2022-04-15 11:38:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 265 transitions. [2022-04-15 11:38:42,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:42,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:42,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-15 11:38:42,323 INFO L87 Difference]: Start difference. First operand has 169 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-15 11:38:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:42,325 INFO L93 Difference]: Finished difference Result 180 states and 265 transitions. [2022-04-15 11:38:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 265 transitions. [2022-04-15 11:38:42,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:42,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:42,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:42,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2022-04-15 11:38:42,329 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 69 [2022-04-15 11:38:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:42,330 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2022-04-15 11:38:42,330 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:42,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 251 transitions. [2022-04-15 11:38:42,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2022-04-15 11:38:42,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 11:38:42,505 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:42,505 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:42,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:38:42,506 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:42,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash -167412983, now seen corresponding path program 1 times [2022-04-15 11:38:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:42,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1178164694] [2022-04-15 11:38:42,660 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 22 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:38:42,660 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:38:42,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2099364604, now seen corresponding path program 1 times [2022-04-15 11:38:42,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:42,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421977208] [2022-04-15 11:38:42,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:42,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:42,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:42,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {15314#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {15308#true} is VALID [2022-04-15 11:38:42,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {15308#true} assume true; {15308#true} is VALID [2022-04-15 11:38:42,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15308#true} {15308#true} #664#return; {15308#true} is VALID [2022-04-15 11:38:42,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {15308#true} call ULTIMATE.init(); {15314#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:38:42,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {15314#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {15308#true} is VALID [2022-04-15 11:38:42,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {15308#true} assume true; {15308#true} is VALID [2022-04-15 11:38:42,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15308#true} {15308#true} #664#return; {15308#true} is VALID [2022-04-15 11:38:42,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {15308#true} call #t~ret162 := main(); {15308#true} is VALID [2022-04-15 11:38:42,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {15308#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {15308#true} is VALID [2022-04-15 11:38:42,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {15308#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {15308#true} is VALID [2022-04-15 11:38:42,784 INFO L272 TraceCheckUtils]: 7: Hoare triple {15308#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {15308#true} is VALID [2022-04-15 11:38:42,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {15308#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} [678] L1166-2-->L1167_primed: Formula: (let ((.cse0 (= v_ssl3_accept_~tmp___4~0_29 v_ssl3_accept_~tmp___4~0_28)) (.cse1 (= |v_ssl3_accept_#t~mem151.base_42| |v_ssl3_accept_#t~mem151.base_40|)) (.cse2 (= |v_ssl3_accept_#t~mem42_48| |v_ssl3_accept_#t~mem42_46|)) (.cse3 (= |v_ssl3_accept_#t~nondet80_39| |v_ssl3_accept_#t~nondet80_37|)) (.cse4 (= |v_ssl3_accept_#t~mem78.base_42| |v_ssl3_accept_#t~mem78.base_40|)) (.cse5 (= |v_ssl3_accept_#t~mem78.offset_42| |v_ssl3_accept_#t~mem78.offset_40|)) (.cse6 (= |v_ssl3_accept_#t~mem44_30| |v_ssl3_accept_#t~mem44_28|)) (.cse7 (= v_ssl3_accept_~state~0_32 v_ssl3_accept_~state~0_31)) (.cse8 (= |v_ssl3_accept_#t~mem86_27| |v_ssl3_accept_#t~mem86_26|)) (.cse9 (= |v_ssl3_accept_#t~mem85.base_27| |v_ssl3_accept_#t~mem85.base_26|)) (.cse10 (= |v_ssl3_accept_#t~mem151.offset_42| |v_ssl3_accept_#t~mem151.offset_40|)) (.cse11 (= |v_ssl3_accept_#t~mem81_42| |v_ssl3_accept_#t~mem81_40|)) (.cse12 (= |v_ssl3_accept_#t~mem43_46| |v_ssl3_accept_#t~mem43_44|)) (.cse13 (= |v_ssl3_accept_#t~mem77_42| |v_ssl3_accept_#t~mem77_40|)) (.cse14 (= |v_ssl3_accept_#t~mem152_44| |v_ssl3_accept_#t~mem152_42|))) (or (and (= |v_#memory_$Pointer$.offset_407| |v_#memory_$Pointer$.offset_401|) .cse0 .cse1 (= |v_ssl3_accept_#t~mem45_14| |v_ssl3_accept_#t~mem45_12|) .cse2 .cse3 .cse4 .cse5 (= |v_#memory_int_377| |v_#memory_int_372|) .cse6 (= |v_#memory_$Pointer$.base_407| |v_#memory_$Pointer$.base_401|) (= v_ssl3_accept_~skip~0_40 v_ssl3_accept_~skip~0_39) .cse7 .cse8 .cse9 (= |v_ssl3_accept_#t~mem85.offset_27| |v_ssl3_accept_#t~mem85.offset_26|) .cse10 .cse11 (= |v_ssl3_accept_#t~mem41_30| |v_ssl3_accept_#t~mem41_29|) .cse12 .cse13 .cse14) (and .cse0 (= v_ssl3_accept_~skip~0_39 v_ssl3_accept_~skip~0_40) .cse1 .cse2 (= |v_ssl3_accept_#t~mem41_29| |v_ssl3_accept_#t~mem41_30|) .cse3 (= |v_#memory_$Pointer$.offset_401| |v_#memory_$Pointer$.offset_407|) (= |v_ssl3_accept_#t~mem85.offset_26| |v_ssl3_accept_#t~mem85.offset_27|) (= |v_#memory_$Pointer$.base_401| |v_#memory_$Pointer$.base_407|) .cse4 .cse5 .cse6 (= |v_ssl3_accept_#t~mem45_12| |v_ssl3_accept_#t~mem45_14|) .cse7 .cse8 .cse9 (= |v_#memory_int_372| |v_#memory_int_377|) .cse10 .cse11 .cse12 .cse13 .cse14))) InVars {ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_42|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_407|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_42|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_30|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_42|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_29, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_27|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_39|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_42|, ssl3_accept_#t~mem45=|v_ssl3_accept_#t~mem45_14|, ssl3_accept_#t~mem44=|v_ssl3_accept_#t~mem44_30|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_40, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_46|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_48|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_44|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_42|, #memory_int=|v_#memory_int_377|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_27|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_42|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_407|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_32, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_27|} OutVars{ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_40|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_401|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_40|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_29|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_40|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_28, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_26|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_37|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_40|, ssl3_accept_#t~mem45=|v_ssl3_accept_#t~mem45_12|, ssl3_accept_#t~mem44=|v_ssl3_accept_#t~mem44_28|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_39, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_44|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_46|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_42|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_40|, #memory_int=|v_#memory_int_372|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_26|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_401|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_31, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_26|} AuxVars[] AssignedVars[ssl3_accept_#t~mem81, #memory_$Pointer$.base, ssl3_accept_#t~mem78.base, ssl3_accept_#t~mem41, ssl3_accept_#t~mem151.base, ssl3_accept_~tmp___4~0, ssl3_accept_#t~mem85.base, ssl3_accept_#t~nondet80, ssl3_accept_#t~mem78.offset, ssl3_accept_#t~mem45, ssl3_accept_#t~mem44, ssl3_accept_~skip~0, ssl3_accept_#t~mem43, ssl3_accept_#t~mem42, ssl3_accept_#t~mem152, ssl3_accept_#t~mem151.offset, #memory_int, ssl3_accept_#t~mem86, ssl3_accept_#t~mem77, #memory_$Pointer$.offset, ssl3_accept_~state~0, ssl3_accept_#t~mem85.offset] {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} [677] L1167_primed-->L1167: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,820 INFO L290 TraceCheckUtils]: 32: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,821 INFO L290 TraceCheckUtils]: 35: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,824 INFO L290 TraceCheckUtils]: 42: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,824 INFO L290 TraceCheckUtils]: 44: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,824 INFO L290 TraceCheckUtils]: 45: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,825 INFO L290 TraceCheckUtils]: 46: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,825 INFO L290 TraceCheckUtils]: 47: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,825 INFO L290 TraceCheckUtils]: 48: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,826 INFO L290 TraceCheckUtils]: 49: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem74;havoc #t~mem74; {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,826 INFO L290 TraceCheckUtils]: 50: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {15313#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:42,826 INFO L290 TraceCheckUtils]: 51: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {15309#false} is VALID [2022-04-15 11:38:42,827 INFO L290 TraceCheckUtils]: 52: Hoare triple {15309#false} assume !false; {15309#false} is VALID [2022-04-15 11:38:42,827 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-15 11:38:42,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:42,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421977208] [2022-04-15 11:38:42,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421977208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:42,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:42,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:38:47,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:47,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1178164694] [2022-04-15 11:38:47,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1178164694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:47,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:47,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 11:38:47,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950165457] [2022-04-15 11:38:47,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:47,190 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:38:47,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:47,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:47,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:47,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 11:38:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:47,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 11:38:47,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:38:47,272 INFO L87 Difference]: Start difference. First operand 169 states and 251 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:50,925 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:52,930 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-15 11:38:54,949 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-15 11:38:56,971 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-15 11:38:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:58,334 INFO L93 Difference]: Finished difference Result 320 states and 481 transitions. [2022-04-15 11:38:58,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:38:58,334 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:38:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 424 transitions. [2022-04-15 11:38:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 424 transitions. [2022-04-15 11:38:58,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 424 transitions. [2022-04-15 11:38:58,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 424 edges. 424 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:58,647 INFO L225 Difference]: With dead ends: 320 [2022-04-15 11:38:58,647 INFO L226 Difference]: Without dead ends: 179 [2022-04-15 11:38:58,647 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:38:58,648 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:58,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 582 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 453 Invalid, 3 Unknown, 135 Unchecked, 8.1s Time] [2022-04-15 11:38:58,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-15 11:38:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2022-04-15 11:38:58,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:58,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:58,662 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:58,663 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:58,665 INFO L93 Difference]: Finished difference Result 179 states and 263 transitions. [2022-04-15 11:38:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 263 transitions. [2022-04-15 11:38:58,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:58,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:58,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 179 states. [2022-04-15 11:38:58,668 INFO L87 Difference]: Start difference. First operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 179 states. [2022-04-15 11:38:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:58,671 INFO L93 Difference]: Finished difference Result 179 states and 263 transitions. [2022-04-15 11:38:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 263 transitions. [2022-04-15 11:38:58,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:58,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:58,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:58,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 261 transitions. [2022-04-15 11:38:58,676 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 261 transitions. Word has length 69 [2022-04-15 11:38:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:58,676 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 261 transitions. [2022-04-15 11:38:58,676 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:58,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 261 transitions. [2022-04-15 11:38:58,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 261 transitions. [2022-04-15 11:38:58,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 11:38:58,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:58,904 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:58,904 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:38:58,904 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:58,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1771749063, now seen corresponding path program 1 times [2022-04-15 11:38:58,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:58,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [625130735] [2022-04-15 11:38:59,069 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 22 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:38:59,070 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:38:59,070 INFO L85 PathProgramCache]: Analyzing trace with hash -679123772, now seen corresponding path program 1 times [2022-04-15 11:38:59,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:59,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796438904] [2022-04-15 11:38:59,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:59,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:59,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:59,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {16687#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {16681#true} is VALID [2022-04-15 11:38:59,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {16681#true} assume true; {16681#true} is VALID [2022-04-15 11:38:59,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16681#true} {16681#true} #664#return; {16681#true} is VALID [2022-04-15 11:38:59,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {16681#true} call ULTIMATE.init(); {16687#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:38:59,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {16687#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {16681#true} is VALID [2022-04-15 11:38:59,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {16681#true} assume true; {16681#true} is VALID [2022-04-15 11:38:59,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16681#true} {16681#true} #664#return; {16681#true} is VALID [2022-04-15 11:38:59,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {16681#true} call #t~ret162 := main(); {16681#true} is VALID [2022-04-15 11:38:59,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {16681#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16681#true} is VALID [2022-04-15 11:38:59,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {16681#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16681#true} is VALID [2022-04-15 11:38:59,176 INFO L272 TraceCheckUtils]: 7: Hoare triple {16681#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16681#true} is VALID [2022-04-15 11:38:59,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {16681#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} [680] L1166-2-->L1167_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem85.offset_32| |v_ssl3_accept_#t~mem85.offset_31|)) (.cse1 (= v_ssl3_accept_~skip~0_45 v_ssl3_accept_~skip~0_44)) (.cse2 (= |v_ssl3_accept_#t~mem81_49| |v_ssl3_accept_#t~mem81_47|)) (.cse3 (= v_ssl3_accept_~tmp___4~0_34 v_ssl3_accept_~tmp___4~0_33)) (.cse4 (= |v_ssl3_accept_#t~mem45_21| |v_ssl3_accept_#t~mem45_19|)) (.cse5 (= |v_ssl3_accept_#t~mem41_35| |v_ssl3_accept_#t~mem41_34|)) (.cse6 (= |v_ssl3_accept_#t~mem151.offset_48| |v_ssl3_accept_#t~mem151.offset_46|)) (.cse7 (= |v_ssl3_accept_#t~mem43_53| |v_ssl3_accept_#t~mem43_51|)) (.cse8 (= |v_ssl3_accept_#t~mem78.base_49| |v_ssl3_accept_#t~mem78.base_47|)) (.cse9 (= |v_ssl3_accept_#t~nondet80_46| |v_ssl3_accept_#t~nondet80_44|)) (.cse10 (= |v_ssl3_accept_#t~mem85.base_32| |v_ssl3_accept_#t~mem85.base_31|)) (.cse11 (= |v_ssl3_accept_#t~mem77_49| |v_ssl3_accept_#t~mem77_47|)) (.cse12 (= |v_ssl3_accept_#t~mem44_37| |v_ssl3_accept_#t~mem44_35|)) (.cse13 (= |v_ssl3_accept_#t~mem78.offset_49| |v_ssl3_accept_#t~mem78.offset_47|)) (.cse14 (= v_ssl3_accept_~state~0_37 v_ssl3_accept_~state~0_36))) (or (and .cse0 (= |v_ssl3_accept_#t~mem151.base_48| |v_ssl3_accept_#t~mem151.base_46|) .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_#memory_$Pointer$.base_427| |v_#memory_$Pointer$.base_421|) .cse6 .cse7 .cse8 .cse9 (= |v_ssl3_accept_#t~mem152_50| |v_ssl3_accept_#t~mem152_48|) .cse10 .cse11 .cse12 (= |v_#memory_$Pointer$.offset_427| |v_#memory_$Pointer$.offset_421|) (= |v_ssl3_accept_#t~mem42_55| |v_ssl3_accept_#t~mem42_53|) .cse13 .cse14 (= |v_#memory_int_396| |v_#memory_int_391|) (= |v_ssl3_accept_#t~mem86_32| |v_ssl3_accept_#t~mem86_31|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem42_53| |v_ssl3_accept_#t~mem42_55|) (= |v_#memory_$Pointer$.offset_421| |v_#memory_$Pointer$.offset_427|) .cse6 .cse7 (= |v_#memory_$Pointer$.base_421| |v_#memory_$Pointer$.base_427|) .cse8 (= |v_ssl3_accept_#t~mem86_31| |v_ssl3_accept_#t~mem86_32|) .cse9 .cse10 (= |v_#memory_int_391| |v_#memory_int_396|) .cse11 .cse12 .cse13 .cse14 (= |v_ssl3_accept_#t~mem151.base_46| |v_ssl3_accept_#t~mem151.base_48|) (= |v_ssl3_accept_#t~mem152_48| |v_ssl3_accept_#t~mem152_50|)))) InVars {ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_427|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_49|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_35|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_48|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_34, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_32|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_46|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_49|, ssl3_accept_#t~mem45=|v_ssl3_accept_#t~mem45_21|, ssl3_accept_#t~mem44=|v_ssl3_accept_#t~mem44_37|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_45, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_53|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_55|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_50|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_48|, #memory_int=|v_#memory_int_396|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_32|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_49|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_427|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_37, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_32|} OutVars{ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_47|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_421|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_47|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_34|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_46|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_33, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_31|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_44|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_47|, ssl3_accept_#t~mem45=|v_ssl3_accept_#t~mem45_19|, ssl3_accept_#t~mem44=|v_ssl3_accept_#t~mem44_35|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_44, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_51|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_53|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_48|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_46|, #memory_int=|v_#memory_int_391|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_31|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_47|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_421|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_36, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_31|} AuxVars[] AssignedVars[ssl3_accept_#t~mem81, #memory_$Pointer$.base, ssl3_accept_#t~mem78.base, ssl3_accept_#t~mem41, ssl3_accept_#t~mem151.base, ssl3_accept_~tmp___4~0, ssl3_accept_#t~mem85.base, ssl3_accept_#t~nondet80, ssl3_accept_#t~mem78.offset, ssl3_accept_#t~mem45, ssl3_accept_#t~mem44, ssl3_accept_~skip~0, ssl3_accept_#t~mem43, ssl3_accept_#t~mem42, ssl3_accept_#t~mem152, ssl3_accept_#t~mem151.offset, #memory_int, ssl3_accept_#t~mem86, ssl3_accept_#t~mem77, #memory_$Pointer$.offset, ssl3_accept_~state~0, ssl3_accept_#t~mem85.offset] {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} [679] L1167_primed-->L1167: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,187 INFO L290 TraceCheckUtils]: 39: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,188 INFO L290 TraceCheckUtils]: 43: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,188 INFO L290 TraceCheckUtils]: 44: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,189 INFO L290 TraceCheckUtils]: 45: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,189 INFO L290 TraceCheckUtils]: 46: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,189 INFO L290 TraceCheckUtils]: 47: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,190 INFO L290 TraceCheckUtils]: 48: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,190 INFO L290 TraceCheckUtils]: 49: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem74;havoc #t~mem74; {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,190 INFO L290 TraceCheckUtils]: 50: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {16686#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:59,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {16682#false} is VALID [2022-04-15 11:38:59,191 INFO L290 TraceCheckUtils]: 52: Hoare triple {16682#false} assume !false; {16682#false} is VALID [2022-04-15 11:38:59,191 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-15 11:38:59,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:59,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796438904] [2022-04-15 11:38:59,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796438904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:59,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:59,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:39:03,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:03,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [625130735] [2022-04-15 11:39:03,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [625130735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:03,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:03,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 11:39:03,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84963477] [2022-04-15 11:39:03,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:03,104 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:39:03,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:03,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:03,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:03,176 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 11:39:03,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:03,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 11:39:03,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:39:03,176 INFO L87 Difference]: Start difference. First operand 177 states and 261 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:05,207 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-15 11:39:08,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:08,434 INFO L93 Difference]: Finished difference Result 464 states and 704 transitions. [2022-04-15 11:39:08,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:39:08,434 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:39:08,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 595 transitions. [2022-04-15 11:39:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 595 transitions. [2022-04-15 11:39:08,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 595 transitions. [2022-04-15 11:39:08,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:08,907 INFO L225 Difference]: With dead ends: 464 [2022-04-15 11:39:08,907 INFO L226 Difference]: Without dead ends: 323 [2022-04-15 11:39:08,908 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:39:08,911 INFO L913 BasicCegarLoop]: 344 mSDtfsCounter, 146 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:39:08,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 1190 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1076 Invalid, 1 Unknown, 193 Unchecked, 3.2s Time] [2022-04-15 11:39:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-04-15 11:39:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 315. [2022-04-15 11:39:08,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:08,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 323 states. Second operand has 315 states, 310 states have (on average 1.5064516129032257) internal successors, (467), 310 states have internal predecessors, (467), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:08,925 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand has 315 states, 310 states have (on average 1.5064516129032257) internal successors, (467), 310 states have internal predecessors, (467), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:08,926 INFO L87 Difference]: Start difference. First operand 323 states. Second operand has 315 states, 310 states have (on average 1.5064516129032257) internal successors, (467), 310 states have internal predecessors, (467), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:08,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:08,932 INFO L93 Difference]: Finished difference Result 323 states and 480 transitions. [2022-04-15 11:39:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 480 transitions. [2022-04-15 11:39:08,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:08,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:08,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 315 states, 310 states have (on average 1.5064516129032257) internal successors, (467), 310 states have internal predecessors, (467), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 323 states. [2022-04-15 11:39:08,934 INFO L87 Difference]: Start difference. First operand has 315 states, 310 states have (on average 1.5064516129032257) internal successors, (467), 310 states have internal predecessors, (467), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 323 states. [2022-04-15 11:39:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:08,941 INFO L93 Difference]: Finished difference Result 323 states and 480 transitions. [2022-04-15 11:39:08,941 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 480 transitions. [2022-04-15 11:39:08,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:08,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:08,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:08,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.5064516129032257) internal successors, (467), 310 states have internal predecessors, (467), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 471 transitions. [2022-04-15 11:39:08,951 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 471 transitions. Word has length 69 [2022-04-15 11:39:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:08,952 INFO L478 AbstractCegarLoop]: Abstraction has 315 states and 471 transitions. [2022-04-15 11:39:08,953 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:08,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 315 states and 471 transitions. [2022-04-15 11:39:09,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 471 transitions. [2022-04-15 11:39:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 11:39:09,359 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:09,359 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:09,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:39:09,359 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:09,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:09,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1642777843, now seen corresponding path program 1 times [2022-04-15 11:39:09,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:09,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [152527451] [2022-04-15 11:39:09,380 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:39:09,380 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:39:09,380 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:39:09,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1642777843, now seen corresponding path program 2 times [2022-04-15 11:39:09,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:09,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316048822] [2022-04-15 11:39:09,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:09,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:09,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:09,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {18913#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {18906#true} is VALID [2022-04-15 11:39:09,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {18906#true} assume true; {18906#true} is VALID [2022-04-15 11:39:09,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18906#true} {18906#true} #664#return; {18906#true} is VALID [2022-04-15 11:39:09,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {18906#true} call ULTIMATE.init(); {18913#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:39:09,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {18913#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {18906#true} is VALID [2022-04-15 11:39:09,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {18906#true} assume true; {18906#true} is VALID [2022-04-15 11:39:09,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18906#true} {18906#true} #664#return; {18906#true} is VALID [2022-04-15 11:39:09,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {18906#true} call #t~ret162 := main(); {18906#true} is VALID [2022-04-15 11:39:09,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {18906#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18906#true} is VALID [2022-04-15 11:39:09,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {18906#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {18906#true} is VALID [2022-04-15 11:39:09,507 INFO L272 TraceCheckUtils]: 7: Hoare triple {18906#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18906#true} is VALID [2022-04-15 11:39:09,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {18906#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18906#true} is VALID [2022-04-15 11:39:09,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {18906#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {18906#true} is VALID [2022-04-15 11:39:09,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {18906#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {18906#true} is VALID [2022-04-15 11:39:09,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {18906#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18906#true} is VALID [2022-04-15 11:39:09,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {18906#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {18906#true} is VALID [2022-04-15 11:39:09,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {18906#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {18906#true} is VALID [2022-04-15 11:39:09,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {18906#true} assume !false; {18906#true} is VALID [2022-04-15 11:39:09,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {18906#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {18906#true} is VALID [2022-04-15 11:39:09,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {18906#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18906#true} is VALID [2022-04-15 11:39:09,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {18906#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18906#true} is VALID [2022-04-15 11:39:09,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {18906#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18906#true} is VALID [2022-04-15 11:39:09,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {18906#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18906#true} is VALID [2022-04-15 11:39:09,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {18906#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18906#true} is VALID [2022-04-15 11:39:09,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {18906#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18906#true} is VALID [2022-04-15 11:39:09,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {18906#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18906#true} is VALID [2022-04-15 11:39:09,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {18906#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18906#true} is VALID [2022-04-15 11:39:09,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {18906#true} assume 8464 == #t~mem50;havoc #t~mem50; {18906#true} is VALID [2022-04-15 11:39:09,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {18906#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {18906#true} is VALID [2022-04-15 11:39:09,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {18906#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18906#true} is VALID [2022-04-15 11:39:09,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {18906#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); {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:09,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {18911#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18912#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-15 11:39:09,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {18912#(= |ssl3_accept_#t~mem53| 8496)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {18907#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {18907#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {18907#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {18907#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {18907#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {18907#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,518 INFO L290 TraceCheckUtils]: 51: Hoare triple {18907#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,518 INFO L290 TraceCheckUtils]: 52: Hoare triple {18907#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,518 INFO L290 TraceCheckUtils]: 53: Hoare triple {18907#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,518 INFO L290 TraceCheckUtils]: 54: Hoare triple {18907#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,518 INFO L290 TraceCheckUtils]: 55: Hoare triple {18907#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,518 INFO L290 TraceCheckUtils]: 56: Hoare triple {18907#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,518 INFO L290 TraceCheckUtils]: 57: Hoare triple {18907#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,518 INFO L290 TraceCheckUtils]: 58: Hoare triple {18907#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,518 INFO L290 TraceCheckUtils]: 59: Hoare triple {18907#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,518 INFO L290 TraceCheckUtils]: 60: Hoare triple {18907#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,519 INFO L290 TraceCheckUtils]: 61: Hoare triple {18907#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,519 INFO L290 TraceCheckUtils]: 62: Hoare triple {18907#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,519 INFO L290 TraceCheckUtils]: 63: Hoare triple {18907#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,519 INFO L290 TraceCheckUtils]: 64: Hoare triple {18907#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {18907#false} is VALID [2022-04-15 11:39:09,519 INFO L290 TraceCheckUtils]: 65: Hoare triple {18907#false} assume 8672 == #t~mem74;havoc #t~mem74; {18907#false} is VALID [2022-04-15 11:39:09,519 INFO L290 TraceCheckUtils]: 66: Hoare triple {18907#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {18907#false} is VALID [2022-04-15 11:39:09,519 INFO L290 TraceCheckUtils]: 67: Hoare triple {18907#false} assume 4 == ~blastFlag~0; {18907#false} is VALID [2022-04-15 11:39:09,519 INFO L290 TraceCheckUtils]: 68: Hoare triple {18907#false} assume !false; {18907#false} is VALID [2022-04-15 11:39:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:39:09,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:09,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316048822] [2022-04-15 11:39:09,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316048822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:09,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:09,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:09,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:09,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [152527451] [2022-04-15 11:39:09,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [152527451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:09,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:09,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:09,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359550469] [2022-04-15 11:39:09,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:09,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:39:09,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:09,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:09,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:09,575 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:39:09,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:09,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:39:09,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:39:09,576 INFO L87 Difference]: Start difference. First operand 315 states and 471 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:11,605 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-15 11:39:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:12,838 INFO L93 Difference]: Finished difference Result 499 states and 753 transitions. [2022-04-15 11:39:12,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:39:12,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:39:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-15 11:39:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-15 11:39:12,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 462 transitions. [2022-04-15 11:39:13,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:13,180 INFO L225 Difference]: With dead ends: 499 [2022-04-15 11:39:13,180 INFO L226 Difference]: Without dead ends: 358 [2022-04-15 11:39:13,180 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-15 11:39:13,181 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 33 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:39:13,183 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 510 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:39:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-04-15 11:39:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 337. [2022-04-15 11:39:13,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:13,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 337 states, 332 states have (on average 1.5180722891566265) internal successors, (504), 332 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:13,200 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 337 states, 332 states have (on average 1.5180722891566265) internal successors, (504), 332 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:13,200 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 337 states, 332 states have (on average 1.5180722891566265) internal successors, (504), 332 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:13,208 INFO L93 Difference]: Finished difference Result 358 states and 535 transitions. [2022-04-15 11:39:13,208 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 535 transitions. [2022-04-15 11:39:13,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:13,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:13,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 337 states, 332 states have (on average 1.5180722891566265) internal successors, (504), 332 states have internal predecessors, (504), 3 states have call successors, (3), 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 358 states. [2022-04-15 11:39:13,211 INFO L87 Difference]: Start difference. First operand has 337 states, 332 states have (on average 1.5180722891566265) internal successors, (504), 332 states have internal predecessors, (504), 3 states have call successors, (3), 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 358 states. [2022-04-15 11:39:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:13,219 INFO L93 Difference]: Finished difference Result 358 states and 535 transitions. [2022-04-15 11:39:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 535 transitions. [2022-04-15 11:39:13,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:13,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:13,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:13,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 332 states have (on average 1.5180722891566265) internal successors, (504), 332 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 508 transitions. [2022-04-15 11:39:13,228 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 508 transitions. Word has length 69 [2022-04-15 11:39:13,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:13,229 INFO L478 AbstractCegarLoop]: Abstraction has 337 states and 508 transitions. [2022-04-15 11:39:13,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:13,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 337 states and 508 transitions. [2022-04-15 11:39:13,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 508 transitions. [2022-04-15 11:39:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 11:39:13,710 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:13,710 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:13,710 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:39:13,711 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:13,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:13,711 INFO L85 PathProgramCache]: Analyzing trace with hash -299545146, now seen corresponding path program 1 times [2022-04-15 11:39:13,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:13,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [744422864] [2022-04-15 11:39:13,748 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:39:13,748 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:39:13,748 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:39:13,749 INFO L85 PathProgramCache]: Analyzing trace with hash -299545146, now seen corresponding path program 2 times [2022-04-15 11:39:13,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:13,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858113837] [2022-04-15 11:39:13,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:13,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:13,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:13,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {21313#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {21306#true} is VALID [2022-04-15 11:39:13,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {21306#true} assume true; {21306#true} is VALID [2022-04-15 11:39:13,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21306#true} {21306#true} #664#return; {21306#true} is VALID [2022-04-15 11:39:13,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {21306#true} call ULTIMATE.init(); {21313#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:39:13,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {21313#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {21306#true} is VALID [2022-04-15 11:39:13,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {21306#true} assume true; {21306#true} is VALID [2022-04-15 11:39:13,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21306#true} {21306#true} #664#return; {21306#true} is VALID [2022-04-15 11:39:13,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {21306#true} call #t~ret162 := main(); {21306#true} is VALID [2022-04-15 11:39:13,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {21306#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {21306#true} is VALID [2022-04-15 11:39:13,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {21306#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {21306#true} is VALID [2022-04-15 11:39:13,915 INFO L272 TraceCheckUtils]: 7: Hoare triple {21306#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21306#true} is VALID [2022-04-15 11:39:13,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {21306#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21306#true} is VALID [2022-04-15 11:39:13,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {21306#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {21306#true} is VALID [2022-04-15 11:39:13,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {21306#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {21306#true} is VALID [2022-04-15 11:39:13,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {21306#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21306#true} is VALID [2022-04-15 11:39:13,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {21306#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {21306#true} is VALID [2022-04-15 11:39:13,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {21306#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {21306#true} is VALID [2022-04-15 11:39:13,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {21306#true} assume !false; {21306#true} is VALID [2022-04-15 11:39:13,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {21306#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {21306#true} is VALID [2022-04-15 11:39:13,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {21306#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21306#true} is VALID [2022-04-15 11:39:13,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {21306#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21306#true} is VALID [2022-04-15 11:39:13,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {21306#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21306#true} is VALID [2022-04-15 11:39:13,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {21306#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21306#true} is VALID [2022-04-15 11:39:13,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {21306#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21306#true} is VALID [2022-04-15 11:39:13,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {21306#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21306#true} is VALID [2022-04-15 11:39:13,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {21306#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21306#true} is VALID [2022-04-15 11:39:13,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {21306#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21306#true} is VALID [2022-04-15 11:39:13,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {21306#true} assume 8464 == #t~mem50;havoc #t~mem50; {21306#true} is VALID [2022-04-15 11:39:13,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {21306#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {21306#true} is VALID [2022-04-15 11:39:13,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {21306#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21306#true} is VALID [2022-04-15 11:39:13,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {21306#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); {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:13,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:13,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:13,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:13,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:13,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:13,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:13,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:13,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:13,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:13,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {21311#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21312#(not (= |ssl3_accept_#t~mem47| 8480))} is VALID [2022-04-15 11:39:13,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {21312#(not (= |ssl3_accept_#t~mem47| 8480))} assume 8480 == #t~mem47;havoc #t~mem47; {21307#false} is VALID [2022-04-15 11:39:13,922 INFO L290 TraceCheckUtils]: 39: Hoare triple {21307#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {21307#false} is VALID [2022-04-15 11:39:13,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {21307#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem88.base, 844 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,923 INFO L290 TraceCheckUtils]: 41: Hoare triple {21307#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,923 INFO L290 TraceCheckUtils]: 42: Hoare triple {21307#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {21307#false} is VALID [2022-04-15 11:39:13,923 INFO L290 TraceCheckUtils]: 43: Hoare triple {21307#false} ~skip~0 := 0; {21307#false} is VALID [2022-04-15 11:39:13,923 INFO L290 TraceCheckUtils]: 44: Hoare triple {21307#false} assume !false; {21307#false} is VALID [2022-04-15 11:39:13,923 INFO L290 TraceCheckUtils]: 45: Hoare triple {21307#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,923 INFO L290 TraceCheckUtils]: 46: Hoare triple {21307#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,923 INFO L290 TraceCheckUtils]: 47: Hoare triple {21307#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {21307#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {21307#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {21307#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,924 INFO L290 TraceCheckUtils]: 51: Hoare triple {21307#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {21307#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {21307#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,924 INFO L290 TraceCheckUtils]: 54: Hoare triple {21307#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,924 INFO L290 TraceCheckUtils]: 55: Hoare triple {21307#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {21307#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {21307#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {21307#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,924 INFO L290 TraceCheckUtils]: 59: Hoare triple {21307#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,924 INFO L290 TraceCheckUtils]: 60: Hoare triple {21307#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,925 INFO L290 TraceCheckUtils]: 61: Hoare triple {21307#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,925 INFO L290 TraceCheckUtils]: 62: Hoare triple {21307#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,925 INFO L290 TraceCheckUtils]: 63: Hoare triple {21307#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,925 INFO L290 TraceCheckUtils]: 64: Hoare triple {21307#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {21307#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {21307#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {21307#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,925 INFO L290 TraceCheckUtils]: 68: Hoare triple {21307#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {21307#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,925 INFO L290 TraceCheckUtils]: 70: Hoare triple {21307#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,926 INFO L290 TraceCheckUtils]: 71: Hoare triple {21307#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,926 INFO L290 TraceCheckUtils]: 72: Hoare triple {21307#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,926 INFO L290 TraceCheckUtils]: 73: Hoare triple {21307#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,926 INFO L290 TraceCheckUtils]: 74: Hoare triple {21307#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,926 INFO L290 TraceCheckUtils]: 75: Hoare triple {21307#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,926 INFO L290 TraceCheckUtils]: 76: Hoare triple {21307#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,926 INFO L290 TraceCheckUtils]: 77: Hoare triple {21307#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {21307#false} is VALID [2022-04-15 11:39:13,926 INFO L290 TraceCheckUtils]: 78: Hoare triple {21307#false} assume 8672 == #t~mem74;havoc #t~mem74; {21307#false} is VALID [2022-04-15 11:39:13,926 INFO L290 TraceCheckUtils]: 79: Hoare triple {21307#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {21307#false} is VALID [2022-04-15 11:39:13,926 INFO L290 TraceCheckUtils]: 80: Hoare triple {21307#false} assume 4 == ~blastFlag~0; {21307#false} is VALID [2022-04-15 11:39:13,927 INFO L290 TraceCheckUtils]: 81: Hoare triple {21307#false} assume !false; {21307#false} is VALID [2022-04-15 11:39:13,927 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:39:13,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:13,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858113837] [2022-04-15 11:39:13,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858113837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:13,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:13,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:13,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:13,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [744422864] [2022-04-15 11:39:13,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [744422864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:13,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:13,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:13,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849790630] [2022-04-15 11:39:13,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:13,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 11:39:13,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:13,929 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-15 11:39:13,995 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-15 11:39:13,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:39:13,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:13,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:39:13,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:39:13,996 INFO L87 Difference]: Start difference. First operand 337 states and 508 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-15 11:39:16,030 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-15 11:39:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:17,707 INFO L93 Difference]: Finished difference Result 879 states and 1336 transitions. [2022-04-15 11:39:17,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:39:17,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 11:39:17,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:17,708 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-15 11:39:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-15 11:39:17,725 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-15 11:39:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-15 11:39:17,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 573 transitions. [2022-04-15 11:39:18,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 573 edges. 573 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:18,136 INFO L225 Difference]: With dead ends: 879 [2022-04-15 11:39:18,136 INFO L226 Difference]: Without dead ends: 570 [2022-04-15 11:39:18,137 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-15 11:39:18,137 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 140 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:39:18,137 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 545 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 575 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 11:39:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-04-15 11:39:18,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 369. [2022-04-15 11:39:18,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:18,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 570 states. Second operand has 369 states, 364 states have (on average 1.5247252747252746) internal successors, (555), 364 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:18,159 INFO L74 IsIncluded]: Start isIncluded. First operand 570 states. Second operand has 369 states, 364 states have (on average 1.5247252747252746) internal successors, (555), 364 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:18,160 INFO L87 Difference]: Start difference. First operand 570 states. Second operand has 369 states, 364 states have (on average 1.5247252747252746) internal successors, (555), 364 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:18,175 INFO L93 Difference]: Finished difference Result 570 states and 860 transitions. [2022-04-15 11:39:18,175 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 860 transitions. [2022-04-15 11:39:18,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:18,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:18,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 369 states, 364 states have (on average 1.5247252747252746) internal successors, (555), 364 states have internal predecessors, (555), 3 states have call successors, (3), 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 570 states. [2022-04-15 11:39:18,178 INFO L87 Difference]: Start difference. First operand has 369 states, 364 states have (on average 1.5247252747252746) internal successors, (555), 364 states have internal predecessors, (555), 3 states have call successors, (3), 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 570 states. [2022-04-15 11:39:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:18,193 INFO L93 Difference]: Finished difference Result 570 states and 860 transitions. [2022-04-15 11:39:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 860 transitions. [2022-04-15 11:39:18,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:18,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:18,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:18,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 364 states have (on average 1.5247252747252746) internal successors, (555), 364 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 559 transitions. [2022-04-15 11:39:18,205 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 559 transitions. Word has length 82 [2022-04-15 11:39:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:18,205 INFO L478 AbstractCegarLoop]: Abstraction has 369 states and 559 transitions. [2022-04-15 11:39:18,205 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-15 11:39:18,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 369 states and 559 transitions. [2022-04-15 11:39:18,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 559 transitions. [2022-04-15 11:39:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 11:39:18,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:18,691 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:18,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:39:18,692 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:18,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:18,692 INFO L85 PathProgramCache]: Analyzing trace with hash -301741538, now seen corresponding path program 1 times [2022-04-15 11:39:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:18,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [725510043] [2022-04-15 11:39:18,727 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:39:18,727 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:39:18,727 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:39:18,727 INFO L85 PathProgramCache]: Analyzing trace with hash -301741538, now seen corresponding path program 2 times [2022-04-15 11:39:18,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:18,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871160227] [2022-04-15 11:39:18,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:18,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:18,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:18,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {24961#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {24954#true} is VALID [2022-04-15 11:39:18,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {24954#true} assume true; {24954#true} is VALID [2022-04-15 11:39:18,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24954#true} {24954#true} #664#return; {24954#true} is VALID [2022-04-15 11:39:18,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {24954#true} call ULTIMATE.init(); {24961#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:39:18,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {24961#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {24954#true} is VALID [2022-04-15 11:39:18,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {24954#true} assume true; {24954#true} is VALID [2022-04-15 11:39:18,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24954#true} {24954#true} #664#return; {24954#true} is VALID [2022-04-15 11:39:18,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {24954#true} call #t~ret162 := main(); {24954#true} is VALID [2022-04-15 11:39:18,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {24954#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {24954#true} is VALID [2022-04-15 11:39:18,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {24954#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {24954#true} is VALID [2022-04-15 11:39:18,851 INFO L272 TraceCheckUtils]: 7: Hoare triple {24954#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {24954#true} is VALID [2022-04-15 11:39:18,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {24954#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {24954#true} is VALID [2022-04-15 11:39:18,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {24954#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {24954#true} is VALID [2022-04-15 11:39:18,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {24954#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {24954#true} is VALID [2022-04-15 11:39:18,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {24954#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24954#true} is VALID [2022-04-15 11:39:18,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {24954#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {24954#true} is VALID [2022-04-15 11:39:18,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {24954#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {24954#true} is VALID [2022-04-15 11:39:18,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {24954#true} assume !false; {24954#true} is VALID [2022-04-15 11:39:18,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {24954#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {24954#true} is VALID [2022-04-15 11:39:18,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {24954#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {24954#true} is VALID [2022-04-15 11:39:18,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {24954#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {24954#true} is VALID [2022-04-15 11:39:18,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {24954#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {24954#true} is VALID [2022-04-15 11:39:18,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {24954#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {24954#true} is VALID [2022-04-15 11:39:18,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {24954#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24954#true} is VALID [2022-04-15 11:39:18,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {24954#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24954#true} is VALID [2022-04-15 11:39:18,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {24954#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24954#true} is VALID [2022-04-15 11:39:18,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {24954#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24954#true} is VALID [2022-04-15 11:39:18,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {24954#true} assume 8464 == #t~mem50;havoc #t~mem50; {24954#true} is VALID [2022-04-15 11:39:18,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {24954#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {24954#true} is VALID [2022-04-15 11:39:18,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {24954#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24954#true} is VALID [2022-04-15 11:39:18,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {24954#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); {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:18,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:18,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:18,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:18,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:18,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:18,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:18,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:18,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:18,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:18,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:18,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:18,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {24959#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24960#(not (= |ssl3_accept_#t~mem49| 8482))} is VALID [2022-04-15 11:39:18,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {24960#(not (= |ssl3_accept_#t~mem49| 8482))} assume 8482 == #t~mem49;havoc #t~mem49; {24955#false} is VALID [2022-04-15 11:39:18,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {24955#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,860 INFO L290 TraceCheckUtils]: 42: Hoare triple {24955#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,860 INFO L290 TraceCheckUtils]: 43: Hoare triple {24955#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {24955#false} is VALID [2022-04-15 11:39:18,860 INFO L290 TraceCheckUtils]: 44: Hoare triple {24955#false} ~skip~0 := 0; {24955#false} is VALID [2022-04-15 11:39:18,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {24955#false} assume !false; {24955#false} is VALID [2022-04-15 11:39:18,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {24955#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,860 INFO L290 TraceCheckUtils]: 47: Hoare triple {24955#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,861 INFO L290 TraceCheckUtils]: 48: Hoare triple {24955#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {24955#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {24955#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {24955#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {24955#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {24955#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {24955#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,861 INFO L290 TraceCheckUtils]: 55: Hoare triple {24955#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,861 INFO L290 TraceCheckUtils]: 56: Hoare triple {24955#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,861 INFO L290 TraceCheckUtils]: 57: Hoare triple {24955#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,862 INFO L290 TraceCheckUtils]: 58: Hoare triple {24955#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,862 INFO L290 TraceCheckUtils]: 59: Hoare triple {24955#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,862 INFO L290 TraceCheckUtils]: 60: Hoare triple {24955#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,862 INFO L290 TraceCheckUtils]: 61: Hoare triple {24955#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,862 INFO L290 TraceCheckUtils]: 62: Hoare triple {24955#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,862 INFO L290 TraceCheckUtils]: 63: Hoare triple {24955#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,862 INFO L290 TraceCheckUtils]: 64: Hoare triple {24955#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {24955#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,862 INFO L290 TraceCheckUtils]: 66: Hoare triple {24955#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,863 INFO L290 TraceCheckUtils]: 67: Hoare triple {24955#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,863 INFO L290 TraceCheckUtils]: 68: Hoare triple {24955#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,863 INFO L290 TraceCheckUtils]: 69: Hoare triple {24955#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,863 INFO L290 TraceCheckUtils]: 70: Hoare triple {24955#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,863 INFO L290 TraceCheckUtils]: 71: Hoare triple {24955#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,863 INFO L290 TraceCheckUtils]: 72: Hoare triple {24955#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,863 INFO L290 TraceCheckUtils]: 73: Hoare triple {24955#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,863 INFO L290 TraceCheckUtils]: 74: Hoare triple {24955#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,863 INFO L290 TraceCheckUtils]: 75: Hoare triple {24955#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,863 INFO L290 TraceCheckUtils]: 76: Hoare triple {24955#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,863 INFO L290 TraceCheckUtils]: 77: Hoare triple {24955#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,864 INFO L290 TraceCheckUtils]: 78: Hoare triple {24955#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-15 11:39:18,864 INFO L290 TraceCheckUtils]: 79: Hoare triple {24955#false} assume 8672 == #t~mem74;havoc #t~mem74; {24955#false} is VALID [2022-04-15 11:39:18,864 INFO L290 TraceCheckUtils]: 80: Hoare triple {24955#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {24955#false} is VALID [2022-04-15 11:39:18,864 INFO L290 TraceCheckUtils]: 81: Hoare triple {24955#false} assume 4 == ~blastFlag~0; {24955#false} is VALID [2022-04-15 11:39:18,864 INFO L290 TraceCheckUtils]: 82: Hoare triple {24955#false} assume !false; {24955#false} is VALID [2022-04-15 11:39:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:39:18,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:18,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871160227] [2022-04-15 11:39:18,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871160227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:18,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:18,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:18,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:18,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [725510043] [2022-04-15 11:39:18,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [725510043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:18,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:18,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:18,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918988514] [2022-04-15 11:39:18,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:18,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-15 11:39:18,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:18,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:18,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:18,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:39:18,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:18,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:39:18,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:39:18,941 INFO L87 Difference]: Start difference. First operand 369 states and 559 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:20,970 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-15 11:39:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:22,382 INFO L93 Difference]: Finished difference Result 911 states and 1384 transitions. [2022-04-15 11:39:22,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:39:22,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-15 11:39:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-15 11:39:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-15 11:39:22,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-15 11:39:22,786 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-15 11:39:22,805 INFO L225 Difference]: With dead ends: 911 [2022-04-15 11:39:22,805 INFO L226 Difference]: Without dead ends: 570 [2022-04-15 11:39:22,806 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-15 11:39:22,807 INFO L913 BasicCegarLoop]: 111 mSDtfsCounter, 138 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:39:22,807 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 323 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 11:39:22,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-04-15 11:39:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 371. [2022-04-15 11:39:22,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:22,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 570 states. Second operand has 371 states, 366 states have (on average 1.5191256830601092) internal successors, (556), 366 states have internal predecessors, (556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:22,830 INFO L74 IsIncluded]: Start isIncluded. First operand 570 states. Second operand has 371 states, 366 states have (on average 1.5191256830601092) internal successors, (556), 366 states have internal predecessors, (556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:22,831 INFO L87 Difference]: Start difference. First operand 570 states. Second operand has 371 states, 366 states have (on average 1.5191256830601092) internal successors, (556), 366 states have internal predecessors, (556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:22,845 INFO L93 Difference]: Finished difference Result 570 states and 857 transitions. [2022-04-15 11:39:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 857 transitions. [2022-04-15 11:39:22,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:22,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:22,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 371 states, 366 states have (on average 1.5191256830601092) internal successors, (556), 366 states have internal predecessors, (556), 3 states have call successors, (3), 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 570 states. [2022-04-15 11:39:22,848 INFO L87 Difference]: Start difference. First operand has 371 states, 366 states have (on average 1.5191256830601092) internal successors, (556), 366 states have internal predecessors, (556), 3 states have call successors, (3), 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 570 states. [2022-04-15 11:39:22,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:22,863 INFO L93 Difference]: Finished difference Result 570 states and 857 transitions. [2022-04-15 11:39:22,863 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 857 transitions. [2022-04-15 11:39:22,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:22,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:22,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:22,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 366 states have (on average 1.5191256830601092) internal successors, (556), 366 states have internal predecessors, (556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 560 transitions. [2022-04-15 11:39:22,875 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 560 transitions. Word has length 83 [2022-04-15 11:39:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:22,875 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 560 transitions. [2022-04-15 11:39:22,875 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:22,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 371 states and 560 transitions. [2022-04-15 11:39:23,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 560 edges. 560 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 560 transitions. [2022-04-15 11:39:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 11:39:23,382 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:23,382 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:23,383 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:39:23,383 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:23,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash -276632906, now seen corresponding path program 1 times [2022-04-15 11:39:23,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:23,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [412760785] [2022-04-15 11:39:23,422 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:39:23,422 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:39:23,422 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:39:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash -276632906, now seen corresponding path program 2 times [2022-04-15 11:39:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:23,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602827780] [2022-04-15 11:39:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:23,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:23,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:23,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {28677#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {28670#true} is VALID [2022-04-15 11:39:23,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {28670#true} assume true; {28670#true} is VALID [2022-04-15 11:39:23,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28670#true} {28670#true} #664#return; {28670#true} is VALID [2022-04-15 11:39:23,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {28670#true} call ULTIMATE.init(); {28677#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:39:23,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {28677#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {28670#true} is VALID [2022-04-15 11:39:23,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {28670#true} assume true; {28670#true} is VALID [2022-04-15 11:39:23,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28670#true} {28670#true} #664#return; {28670#true} is VALID [2022-04-15 11:39:23,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {28670#true} call #t~ret162 := main(); {28670#true} is VALID [2022-04-15 11:39:23,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {28670#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {28670#true} is VALID [2022-04-15 11:39:23,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {28670#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,571 INFO L272 TraceCheckUtils]: 7: Hoare triple {28670#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {28670#true} is VALID [2022-04-15 11:39:23,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {28670#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {28670#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {28670#true} is VALID [2022-04-15 11:39:23,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {28670#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {28670#true} is VALID [2022-04-15 11:39:23,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {28670#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {28670#true} is VALID [2022-04-15 11:39:23,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {28670#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {28670#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {28670#true} is VALID [2022-04-15 11:39:23,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {28670#true} assume !false; {28670#true} is VALID [2022-04-15 11:39:23,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {28670#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {28670#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {28670#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {28670#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {28670#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {28670#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {28670#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {28670#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {28670#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {28670#true} assume 8464 == #t~mem50;havoc #t~mem50; {28670#true} is VALID [2022-04-15 11:39:23,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {28670#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {28670#true} is VALID [2022-04-15 11:39:23,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {28670#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28670#true} is VALID [2022-04-15 11:39:23,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {28670#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); {28670#true} is VALID [2022-04-15 11:39:23,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {28670#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {28670#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {28670#true} is VALID [2022-04-15 11:39:23,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {28670#true} ~skip~0 := 0; {28670#true} is VALID [2022-04-15 11:39:23,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {28670#true} assume !false; {28670#true} is VALID [2022-04-15 11:39:23,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {28670#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {28670#true} assume 12292 == #t~mem42;havoc #t~mem42; {28670#true} is VALID [2022-04-15 11:39:23,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {28670#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {28670#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {28670#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {28670#true} is VALID [2022-04-15 11:39:23,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {28670#true} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {28670#true} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {28670#true} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {28670#true} is VALID [2022-04-15 11:39:23,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {28670#true} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {28670#true} is VALID [2022-04-15 11:39:23,574 INFO L290 TraceCheckUtils]: 41: Hoare triple {28670#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {28670#true} is VALID [2022-04-15 11:39:23,575 INFO L290 TraceCheckUtils]: 42: Hoare triple {28670#true} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,576 INFO L290 TraceCheckUtils]: 43: Hoare triple {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,577 INFO L290 TraceCheckUtils]: 45: Hoare triple {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,578 INFO L290 TraceCheckUtils]: 46: Hoare triple {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,578 INFO L290 TraceCheckUtils]: 47: Hoare triple {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,578 INFO L290 TraceCheckUtils]: 48: Hoare triple {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,579 INFO L290 TraceCheckUtils]: 49: Hoare triple {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,579 INFO L290 TraceCheckUtils]: 50: Hoare triple {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {28675#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28676#(= |ssl3_accept_#t~mem47| 8480)} is VALID [2022-04-15 11:39:23,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {28676#(= |ssl3_accept_#t~mem47| 8480)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,581 INFO L290 TraceCheckUtils]: 54: Hoare triple {28671#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,581 INFO L290 TraceCheckUtils]: 55: Hoare triple {28671#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,581 INFO L290 TraceCheckUtils]: 56: Hoare triple {28671#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,581 INFO L290 TraceCheckUtils]: 57: Hoare triple {28671#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,581 INFO L290 TraceCheckUtils]: 58: Hoare triple {28671#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,581 INFO L290 TraceCheckUtils]: 59: Hoare triple {28671#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,581 INFO L290 TraceCheckUtils]: 60: Hoare triple {28671#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,582 INFO L290 TraceCheckUtils]: 61: Hoare triple {28671#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,582 INFO L290 TraceCheckUtils]: 62: Hoare triple {28671#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,582 INFO L290 TraceCheckUtils]: 63: Hoare triple {28671#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,582 INFO L290 TraceCheckUtils]: 64: Hoare triple {28671#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,582 INFO L290 TraceCheckUtils]: 65: Hoare triple {28671#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,582 INFO L290 TraceCheckUtils]: 66: Hoare triple {28671#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,582 INFO L290 TraceCheckUtils]: 67: Hoare triple {28671#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,582 INFO L290 TraceCheckUtils]: 68: Hoare triple {28671#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,582 INFO L290 TraceCheckUtils]: 69: Hoare triple {28671#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,582 INFO L290 TraceCheckUtils]: 70: Hoare triple {28671#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,583 INFO L290 TraceCheckUtils]: 71: Hoare triple {28671#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,583 INFO L290 TraceCheckUtils]: 72: Hoare triple {28671#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,583 INFO L290 TraceCheckUtils]: 73: Hoare triple {28671#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,583 INFO L290 TraceCheckUtils]: 74: Hoare triple {28671#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,583 INFO L290 TraceCheckUtils]: 75: Hoare triple {28671#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,583 INFO L290 TraceCheckUtils]: 76: Hoare triple {28671#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,583 INFO L290 TraceCheckUtils]: 77: Hoare triple {28671#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,583 INFO L290 TraceCheckUtils]: 78: Hoare triple {28671#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,583 INFO L290 TraceCheckUtils]: 79: Hoare triple {28671#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {28671#false} is VALID [2022-04-15 11:39:23,583 INFO L290 TraceCheckUtils]: 80: Hoare triple {28671#false} assume 8672 == #t~mem74;havoc #t~mem74; {28671#false} is VALID [2022-04-15 11:39:23,584 INFO L290 TraceCheckUtils]: 81: Hoare triple {28671#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {28671#false} is VALID [2022-04-15 11:39:23,584 INFO L290 TraceCheckUtils]: 82: Hoare triple {28671#false} assume 4 == ~blastFlag~0; {28671#false} is VALID [2022-04-15 11:39:23,584 INFO L290 TraceCheckUtils]: 83: Hoare triple {28671#false} assume !false; {28671#false} is VALID [2022-04-15 11:39:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:39:23,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:23,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602827780] [2022-04-15 11:39:23,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602827780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:23,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:23,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:23,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:23,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [412760785] [2022-04-15 11:39:23,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [412760785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:23,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:23,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:23,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937850228] [2022-04-15 11:39:23,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:23,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-15 11:39:23,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:23,586 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-15 11:39:23,657 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-15 11:39:23,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:39:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:23,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:39:23,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:39:23,659 INFO L87 Difference]: Start difference. First operand 371 states and 560 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-15 11:39:25,689 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-15 11:39:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:26,876 INFO L93 Difference]: Finished difference Result 748 states and 1127 transitions. [2022-04-15 11:39:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:39:26,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-15 11:39:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:26,877 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-15 11:39:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-15 11:39:26,878 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-15 11:39:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-15 11:39:26,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-15 11:39:27,169 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-15 11:39:27,176 INFO L225 Difference]: With dead ends: 748 [2022-04-15 11:39:27,177 INFO L226 Difference]: Without dead ends: 405 [2022-04-15 11:39:27,177 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-15 11:39:27,178 INFO L913 BasicCegarLoop]: 223 mSDtfsCounter, 22 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:39:27,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 553 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:39:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-15 11:39:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 371. [2022-04-15 11:39:27,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:27,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 371 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:27,211 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 371 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:27,211 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 371 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:27,220 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-04-15 11:39:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 600 transitions. [2022-04-15 11:39:27,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:27,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:27,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 371 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-15 11:39:27,222 INFO L87 Difference]: Start difference. First operand has 371 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-15 11:39:27,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:27,231 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-04-15 11:39:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 600 transitions. [2022-04-15 11:39:27,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:27,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:27,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:27,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 558 transitions. [2022-04-15 11:39:27,241 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 558 transitions. Word has length 84 [2022-04-15 11:39:27,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:27,242 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 558 transitions. [2022-04-15 11:39:27,242 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-15 11:39:27,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 371 states and 558 transitions. [2022-04-15 11:39:27,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 558 transitions. [2022-04-15 11:39:27,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 11:39:27,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:27,834 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:27,834 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:39:27,834 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:27,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1096918579, now seen corresponding path program 1 times [2022-04-15 11:39:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:27,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [912415974] [2022-04-15 11:39:28,017 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-15 11:39:28,018 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:39:28,018 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:39:28,019 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) 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-15 11:39:28,023 INFO L158 Benchmark]: Toolchain (without parser) took 119545.99ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 128.0MB in the beginning and 119.4MB in the end (delta: 8.6MB). Peak memory consumption was 45.8MB. Max. memory is 8.0GB. [2022-04-15 11:39:28,023 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory was 146.9MB in the beginning and 146.8MB in the end (delta: 89.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:39:28,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.42ms. Allocated memory is still 180.4MB. Free memory was 127.7MB in the beginning and 136.9MB in the end (delta: -9.1MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-04-15 11:39:28,024 INFO L158 Benchmark]: Boogie Preprocessor took 145.25ms. Allocated memory is still 180.4MB. Free memory was 136.9MB in the beginning and 126.9MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 11:39:28,024 INFO L158 Benchmark]: RCFGBuilder took 3283.65ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 126.9MB in the beginning and 164.1MB in the end (delta: -37.1MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. [2022-04-15 11:39:28,024 INFO L158 Benchmark]: TraceAbstraction took 115538.71ms. Allocated memory is still 217.1MB. Free memory was 163.5MB in the beginning and 119.4MB in the end (delta: 44.1MB). Peak memory consumption was 45.2MB. Max. memory is 8.0GB. [2022-04-15 11:39:28,025 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.14ms. Allocated memory is still 180.4MB. Free memory was 146.9MB in the beginning and 146.8MB in the end (delta: 89.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 571.42ms. Allocated memory is still 180.4MB. Free memory was 127.7MB in the beginning and 136.9MB in the end (delta: -9.1MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 145.25ms. Allocated memory is still 180.4MB. Free memory was 136.9MB in the beginning and 126.9MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 3283.65ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 126.9MB in the beginning and 164.1MB in the end (delta: -37.1MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. * TraceAbstraction took 115538.71ms. Allocated memory is still 217.1MB. Free memory was 163.5MB in the beginning and 119.4MB in the end (delta: 44.1MB). Peak memory consumption was 45.2MB. 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-15 11:39:28,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...