/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-fb4f59a-m [2022-04-28 08:36:04,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:36:04,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:36:04,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:36:04,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:36:04,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:36:04,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:36:04,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:36:04,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:36:04,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:36:04,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:36:04,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:36:04,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:36:04,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:36:04,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:36:04,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:36:04,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:36:04,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:36:04,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:36:04,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:36:04,785 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:36:04,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:36:04,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:36:04,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:36:04,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:36:04,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:36:04,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:36:04,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:36:04,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:36:04,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:36:04,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:36:04,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:36:04,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:36:04,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:36:04,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:36:04,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:36:04,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:36:04,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:36:04,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:36:04,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:36:04,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:36:04,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:36:04,806 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:36:04,818 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:36:04,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:36:04,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:36:04,819 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:36:04,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:36:04,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:36:04,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:36:04,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:36:04,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:36:04,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:36:04,821 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:36:04,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:36:04,821 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:36:04,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:36:04,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:36:04,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:36:04,821 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:36:04,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:36:04,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:36:04,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:36:04,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:36:04,822 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:36:04,822 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:36:04,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:36:04,822 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:36:04,822 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-28 08:36:05,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:36:05,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:36:05,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:36:05,047 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:36:05,048 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:36:05,049 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-28 08:36:05,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28de0cb1c/3a40469bf46d4d2eb0b04c5ffccc38a6/FLAGf007acc63 [2022-04-28 08:36:05,600 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:36:05,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-04-28 08:36:05,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28de0cb1c/3a40469bf46d4d2eb0b04c5ffccc38a6/FLAGf007acc63 [2022-04-28 08:36:05,877 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28de0cb1c/3a40469bf46d4d2eb0b04c5ffccc38a6 [2022-04-28 08:36:05,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:36:05,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:36:05,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:36:05,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:36:05,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:36:05,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:36:05" (1/1) ... [2022-04-28 08:36:05,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6698af7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:36:05, skipping insertion in model container [2022-04-28 08:36:05,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:36:05" (1/1) ... [2022-04-28 08:36:05,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:36:05,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:36:06,318 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-28 08:36:06,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:36:06,352 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:36:06,474 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-28 08:36:06,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:36:06,505 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:36:06,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:36:06 WrapperNode [2022-04-28 08:36:06,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:36:06,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:36:06,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:36:06,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:36:06,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:36:06" (1/1) ... [2022-04-28 08:36:06,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:36:06" (1/1) ... [2022-04-28 08:36:06,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:36:06" (1/1) ... [2022-04-28 08:36:06,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:36:06" (1/1) ... [2022-04-28 08:36:06,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:36:06" (1/1) ... [2022-04-28 08:36:06,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:36:06" (1/1) ... [2022-04-28 08:36:06,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:36:06" (1/1) ... [2022-04-28 08:36:06,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:36:06,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:36:06,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:36:06,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:36:06,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:36:06" (1/1) ... [2022-04-28 08:36:06,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:36:06,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:36:06,696 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-28 08:36:06,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:36:06,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:36:06,741 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:36:06,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 08:36:06,741 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 08:36:06,741 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:36:06,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 08:36:06,741 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 08:36:06,742 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 08:36:06,742 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 08:36:06,742 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:36:06,742 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:36:06,742 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:36:06,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:36:06,742 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 08:36:06,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:36:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:36:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:36:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 08:36:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 08:36:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 08:36:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 08:36:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 08:36:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 08:36:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 08:36:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 08:36:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:36:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 08:36:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:36:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 08:36:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:36:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 08:36:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 08:36:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:36:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:36:06,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:36:06,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 08:36:06,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 08:36:06,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 08:36:06,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 08:36:06,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:36:06,713 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-28 08:36:06,935 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:36:06,937 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:36:09,375 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:36:09,946 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 08:36:09,947 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 08:36:09,957 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:36:09,965 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:36:09,965 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:36:09,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:36:09 BoogieIcfgContainer [2022-04-28 08:36:09,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:36:09,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:36:09,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:36:09,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:36:09,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:36:05" (1/3) ... [2022-04-28 08:36:09,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288133b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:36:09, skipping insertion in model container [2022-04-28 08:36:09,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:36:06" (2/3) ... [2022-04-28 08:36:09,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288133b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:36:09, skipping insertion in model container [2022-04-28 08:36:09,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:36:09" (3/3) ... [2022-04-28 08:36:09,974 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-04-28 08:36:09,987 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:36:09,987 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:36:10,041 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:36:10,050 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e160074, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56c44fb [2022-04-28 08:36:10,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:36:10,061 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-28 08:36:10,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 08:36:10,076 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:10,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:36:10,077 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:10,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash 740864289, now seen corresponding path program 1 times [2022-04-28 08:36:10,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:10,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1023031707] [2022-04-28 08:36:10,099 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:36:10,099 INFO L85 PathProgramCache]: Analyzing trace with hash 740864289, now seen corresponding path program 2 times [2022-04-28 08:36:10,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:10,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732810031] [2022-04-28 08:36:10,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:10,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:10,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:36:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:10,647 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-28 08:36:10,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-28 08:36:10,648 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} #664#return; {158#true} is VALID [2022-04-28 08:36:10,650 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-28 08:36:10,650 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-28 08:36:10,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-28 08:36:10,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} #664#return; {158#true} is VALID [2022-04-28 08:36:10,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} call #t~ret162 := main(); {158#true} is VALID [2022-04-28 08:36:10,652 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-28 08:36:10,652 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-28 08:36:10,652 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-28 08:36:10,659 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-28 08:36:10,660 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-28 08:36:10,661 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-28 08:36:10,662 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-28 08:36:10,662 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-28 08:36:10,663 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-28 08:36:10,664 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-28 08:36:10,664 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-28 08:36:10,666 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-28 08:36:10,668 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-28 08:36:10,668 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-28 08:36:10,669 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-28 08:36:10,670 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-28 08:36:10,670 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-28 08:36:10,671 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-28 08:36:10,672 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-28 08:36:10,673 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-28 08:36:10,673 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-28 08:36:10,674 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-28 08:36:10,675 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-28 08:36:10,675 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-28 08:36:10,675 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-28 08:36:10,676 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-28 08:36:10,676 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-28 08:36:10,676 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-28 08:36:10,676 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-28 08:36:10,676 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-28 08:36:10,677 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-28 08:36:10,677 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-28 08:36:10,678 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-28 08:36:10,678 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-28 08:36:10,678 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-28 08:36:10,679 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-28 08:36:10,680 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-28 08:36:10,680 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-28 08:36:10,680 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-28 08:36:10,681 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-28 08:36:10,681 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-28 08:36:10,687 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-28 08:36:10,687 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-28 08:36:10,688 INFO L290 TraceCheckUtils]: 48: Hoare triple {159#false} assume 8672 == #t~mem74;havoc #t~mem74; {159#false} is VALID [2022-04-28 08:36:10,688 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-28 08:36:10,689 INFO L290 TraceCheckUtils]: 50: Hoare triple {159#false} assume 4 == ~blastFlag~0; {159#false} is VALID [2022-04-28 08:36:10,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {159#false} assume !false; {159#false} is VALID [2022-04-28 08:36:10,693 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-28 08:36:10,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:36:10,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732810031] [2022-04-28 08:36:10,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732810031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:10,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:10,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:10,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:36:10,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1023031707] [2022-04-28 08:36:10,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1023031707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:10,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:10,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:10,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309327083] [2022-04-28 08:36:10,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:36:10,712 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-28 08:36:10,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:36:10,717 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-28 08:36:10,788 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-28 08:36:10,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:36:10,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:10,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:36:10,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:36:10,816 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-28 08:36:12,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-28 08:36:14,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:14,423 INFO L93 Difference]: Finished difference Result 328 states and 543 transitions. [2022-04-28 08:36:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:36:14,424 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-28 08:36:14,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:14,425 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-28 08:36:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-28 08:36:14,444 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-28 08:36:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-28 08:36:14,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 543 transitions. [2022-04-28 08:36:14,903 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-28 08:36:14,917 INFO L225 Difference]: With dead ends: 328 [2022-04-28 08:36:14,917 INFO L226 Difference]: Without dead ends: 167 [2022-04-28 08:36:14,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:36:14,922 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 33 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:36:14,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 583 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 08:36:14,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-28 08:36:14,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2022-04-28 08:36:14,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:14,959 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-28 08:36:14,960 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-28 08:36:14,961 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-28 08:36:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:14,968 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-28 08:36:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-28 08:36:14,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:14,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:14,971 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-28 08:36:14,971 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-28 08:36:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:14,978 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-28 08:36:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-28 08:36:14,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:14,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:14,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:14,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:14,981 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-28 08:36:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2022-04-28 08:36:14,988 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 52 [2022-04-28 08:36:14,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:14,988 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2022-04-28 08:36:14,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:14,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 227 transitions. [2022-04-28 08:36:15,207 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-28 08:36:15,207 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2022-04-28 08:36:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 08:36:15,210 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:15,210 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:36:15,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:36:15,210 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:15,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:15,211 INFO L85 PathProgramCache]: Analyzing trace with hash -444444622, now seen corresponding path program 1 times [2022-04-28 08:36:15,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:15,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [622797459] [2022-04-28 08:36:15,247 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:36:15,247 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:36:15,247 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:36:15,248 INFO L85 PathProgramCache]: Analyzing trace with hash -444444622, now seen corresponding path program 2 times [2022-04-28 08:36:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:15,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043351457] [2022-04-28 08:36:15,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:15,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:15,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:36:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:15,468 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-28 08:36:15,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {1460#true} assume true; {1460#true} is VALID [2022-04-28 08:36:15,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1460#true} {1460#true} #664#return; {1460#true} is VALID [2022-04-28 08:36:15,470 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-28 08:36:15,470 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-28 08:36:15,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {1460#true} assume true; {1460#true} is VALID [2022-04-28 08:36:15,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1460#true} {1460#true} #664#return; {1460#true} is VALID [2022-04-28 08:36:15,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {1460#true} call #t~ret162 := main(); {1460#true} is VALID [2022-04-28 08:36:15,471 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-28 08:36:15,471 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-28 08:36:15,471 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-28 08:36:15,474 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-28 08:36:15,475 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-28 08:36:15,476 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-28 08:36:15,476 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-28 08:36:15,477 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-28 08:36:15,477 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-28 08:36:15,478 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-28 08:36:15,479 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-28 08:36:15,479 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-28 08:36:15,480 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-28 08:36:15,480 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-28 08:36:15,481 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-28 08:36:15,481 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-28 08:36:15,482 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-28 08:36:15,482 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-28 08:36:15,482 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-28 08:36:15,482 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-28 08:36:15,482 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-28 08:36:15,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {1461#false} ~skip~0 := 0; {1461#false} is VALID [2022-04-28 08:36:15,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-28 08:36:15,483 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-28 08:36:15,483 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-28 08:36:15,483 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-28 08:36:15,483 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-28 08:36:15,484 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-28 08:36:15,484 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-28 08:36:15,484 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-28 08:36:15,484 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-28 08:36:15,484 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-28 08:36:15,485 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-28 08:36:15,485 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-28 08:36:15,485 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-28 08:36:15,485 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-28 08:36:15,485 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-28 08:36:15,485 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-28 08:36:15,486 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-28 08:36:15,486 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-28 08:36:15,486 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-28 08:36:15,486 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-28 08:36:15,486 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-28 08:36:15,487 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-28 08:36:15,487 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-28 08:36:15,487 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-28 08:36:15,487 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-28 08:36:15,487 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-28 08:36:15,488 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-28 08:36:15,488 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-28 08:36:15,488 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-28 08:36:15,488 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-28 08:36:15,488 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-28 08:36:15,488 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-28 08:36:15,489 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-28 08:36:15,489 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-28 08:36:15,489 INFO L290 TraceCheckUtils]: 61: Hoare triple {1461#false} assume 8672 == #t~mem74;havoc #t~mem74; {1461#false} is VALID [2022-04-28 08:36:15,489 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-28 08:36:15,489 INFO L290 TraceCheckUtils]: 63: Hoare triple {1461#false} assume 4 == ~blastFlag~0; {1461#false} is VALID [2022-04-28 08:36:15,490 INFO L290 TraceCheckUtils]: 64: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-28 08:36:15,490 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-28 08:36:15,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:36:15,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043351457] [2022-04-28 08:36:15,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043351457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:15,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:15,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:15,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:36:15,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [622797459] [2022-04-28 08:36:15,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [622797459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:15,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:15,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:15,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346327894] [2022-04-28 08:36:15,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:36:15,493 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-28 08:36:15,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:36:15,493 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-28 08:36:15,557 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-28 08:36:15,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:36:15,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:15,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:36:15,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:36:15,559 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-28 08:36:17,587 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-28 08:36:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:18,851 INFO L93 Difference]: Finished difference Result 291 states and 437 transitions. [2022-04-28 08:36:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:36:18,852 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-28 08:36:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:18,852 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-28 08:36:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-28 08:36:18,859 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-28 08:36:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-28 08:36:18,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 437 transitions. [2022-04-28 08:36:19,233 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-28 08:36:19,237 INFO L225 Difference]: With dead ends: 291 [2022-04-28 08:36:19,238 INFO L226 Difference]: Without dead ends: 167 [2022-04-28 08:36:19,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:36:19,240 INFO L413 NwaCegarLoop]: 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-28 08:36:19,240 INFO L414 NwaCegarLoop]: 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-28 08:36:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-28 08:36:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2022-04-28 08:36:19,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:19,250 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-28 08:36:19,251 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-28 08:36:19,251 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-28 08:36:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:19,257 INFO L93 Difference]: Finished difference Result 167 states and 247 transitions. [2022-04-28 08:36:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2022-04-28 08:36:19,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:19,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:19,259 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-28 08:36:19,259 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-28 08:36:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:19,265 INFO L93 Difference]: Finished difference Result 167 states and 247 transitions. [2022-04-28 08:36:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2022-04-28 08:36:19,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:19,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:19,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:19,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:19,267 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-28 08:36:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 226 transitions. [2022-04-28 08:36:19,272 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 226 transitions. Word has length 65 [2022-04-28 08:36:19,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:19,272 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 226 transitions. [2022-04-28 08:36:19,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:19,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 226 transitions. [2022-04-28 08:36:19,441 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-28 08:36:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 226 transitions. [2022-04-28 08:36:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 08:36:19,442 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:19,442 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:36:19,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:36:19,443 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:19,443 INFO L85 PathProgramCache]: Analyzing trace with hash 795477037, now seen corresponding path program 1 times [2022-04-28 08:36:19,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:19,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [318402877] [2022-04-28 08:36:19,466 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:36:19,466 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:36:19,467 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:36:19,467 INFO L85 PathProgramCache]: Analyzing trace with hash 795477037, now seen corresponding path program 2 times [2022-04-28 08:36:19,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:19,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368633506] [2022-04-28 08:36:19,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:19,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:19,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:36:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:19,671 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-28 08:36:19,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {2688#true} assume true; {2688#true} is VALID [2022-04-28 08:36:19,671 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2688#true} {2688#true} #664#return; {2688#true} is VALID [2022-04-28 08:36:19,680 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-28 08:36:19,680 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-28 08:36:19,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {2688#true} assume true; {2688#true} is VALID [2022-04-28 08:36:19,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2688#true} {2688#true} #664#return; {2688#true} is VALID [2022-04-28 08:36:19,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {2688#true} call #t~ret162 := main(); {2688#true} is VALID [2022-04-28 08:36:19,681 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-28 08:36:19,681 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-28 08:36:19,681 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-28 08:36:19,683 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-28 08:36:19,684 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-28 08:36:19,685 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-28 08:36:19,685 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-28 08:36:19,686 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-28 08:36:19,687 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-28 08:36:19,687 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-28 08:36:19,687 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-28 08:36:19,688 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-28 08:36:19,688 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-28 08:36:19,689 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-28 08:36:19,689 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-28 08:36:19,690 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-28 08:36:19,690 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-28 08:36:19,691 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-28 08:36:19,691 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-28 08:36:19,691 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-28 08:36:19,691 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-28 08:36:19,691 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-28 08:36:19,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {2689#false} ~skip~0 := 0; {2689#false} is VALID [2022-04-28 08:36:19,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {2689#false} assume !false; {2689#false} is VALID [2022-04-28 08:36:19,692 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-28 08:36:19,692 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-28 08:36:19,692 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-28 08:36:19,692 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-28 08:36:19,692 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-28 08:36:19,692 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-28 08:36:19,693 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-28 08:36:19,693 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-28 08:36:19,693 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-28 08:36:19,693 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-28 08:36:19,693 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-28 08:36:19,693 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-28 08:36:19,693 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-28 08:36:19,694 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-28 08:36:19,694 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-28 08:36:19,694 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-28 08:36:19,694 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-28 08:36:19,694 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-28 08:36:19,694 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-28 08:36:19,694 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-28 08:36:19,695 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-28 08:36:19,695 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-28 08:36:19,695 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-28 08:36:19,695 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-28 08:36:19,695 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-28 08:36:19,695 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-28 08:36:19,695 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-28 08:36:19,696 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-28 08:36:19,696 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-28 08:36:19,696 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-28 08:36:19,696 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-28 08:36:19,696 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-28 08:36:19,696 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-28 08:36:19,696 INFO L290 TraceCheckUtils]: 62: Hoare triple {2689#false} assume 8672 == #t~mem74;havoc #t~mem74; {2689#false} is VALID [2022-04-28 08:36:19,697 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-28 08:36:19,697 INFO L290 TraceCheckUtils]: 64: Hoare triple {2689#false} assume 4 == ~blastFlag~0; {2689#false} is VALID [2022-04-28 08:36:19,697 INFO L290 TraceCheckUtils]: 65: Hoare triple {2689#false} assume !false; {2689#false} is VALID [2022-04-28 08:36:19,697 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-28 08:36:19,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:36:19,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368633506] [2022-04-28 08:36:19,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368633506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:19,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:19,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:19,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:36:19,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [318402877] [2022-04-28 08:36:19,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [318402877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:19,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:19,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:19,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788700564] [2022-04-28 08:36:19,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:36:19,699 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-28 08:36:19,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:36:19,700 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-28 08:36:19,753 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-28 08:36:19,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:36:19,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:19,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:36:19,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:36:19,754 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-28 08:36:21,781 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-28 08:36:23,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:23,110 INFO L93 Difference]: Finished difference Result 390 states and 594 transitions. [2022-04-28 08:36:23,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:36:23,110 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-28 08:36:23,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:23,110 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-28 08:36:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-28 08:36:23,116 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-28 08:36:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-28 08:36:23,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-28 08:36:23,546 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-28 08:36:23,551 INFO L225 Difference]: With dead ends: 390 [2022-04-28 08:36:23,551 INFO L226 Difference]: Without dead ends: 266 [2022-04-28 08:36:23,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:36:23,553 INFO L413 NwaCegarLoop]: 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-28 08:36:23,553 INFO L414 NwaCegarLoop]: 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-28 08:36:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-04-28 08:36:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 167. [2022-04-28 08:36:23,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:23,565 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-28 08:36:23,565 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-28 08:36:23,566 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-28 08:36:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:23,581 INFO L93 Difference]: Finished difference Result 266 states and 403 transitions. [2022-04-28 08:36:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 403 transitions. [2022-04-28 08:36:23,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:23,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:23,583 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-28 08:36:23,583 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-28 08:36:23,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:23,599 INFO L93 Difference]: Finished difference Result 266 states and 403 transitions. [2022-04-28 08:36:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 403 transitions. [2022-04-28 08:36:23,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:23,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:23,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:23,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:23,600 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-28 08:36:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 253 transitions. [2022-04-28 08:36:23,609 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 253 transitions. Word has length 66 [2022-04-28 08:36:23,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:23,609 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 253 transitions. [2022-04-28 08:36:23,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:23,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 253 transitions. [2022-04-28 08:36:23,789 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-28 08:36:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 253 transitions. [2022-04-28 08:36:23,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 08:36:23,790 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:23,791 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:36:23,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:36:23,791 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:23,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:23,791 INFO L85 PathProgramCache]: Analyzing trace with hash -498657998, now seen corresponding path program 1 times [2022-04-28 08:36:23,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:23,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [721919363] [2022-04-28 08:36:23,810 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:36:23,810 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:36:23,810 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:36:23,811 INFO L85 PathProgramCache]: Analyzing trace with hash -498657998, now seen corresponding path program 2 times [2022-04-28 08:36:23,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:23,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573832609] [2022-04-28 08:36:23,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:23,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:23,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:36:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:24,004 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-28 08:36:24,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {4346#true} assume true; {4346#true} is VALID [2022-04-28 08:36:24,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4346#true} {4346#true} #664#return; {4346#true} is VALID [2022-04-28 08:36:24,006 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-28 08:36:24,006 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-28 08:36:24,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {4346#true} assume true; {4346#true} is VALID [2022-04-28 08:36:24,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4346#true} {4346#true} #664#return; {4346#true} is VALID [2022-04-28 08:36:24,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {4346#true} call #t~ret162 := main(); {4346#true} is VALID [2022-04-28 08:36:24,006 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-28 08:36:24,009 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-28 08:36:24,010 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-28 08:36:24,012 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-28 08:36:24,012 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-28 08:36:24,013 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-28 08:36:24,014 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-28 08:36:24,014 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-28 08:36:24,015 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-28 08:36:24,015 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-28 08:36:24,015 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-28 08:36:24,016 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-28 08:36:24,016 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-28 08:36:24,017 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-28 08:36:24,017 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-28 08:36:24,018 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-28 08:36:24,018 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-28 08:36:24,019 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-28 08:36:24,020 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-28 08:36:24,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {4347#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-28 08:36:24,020 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-28 08:36:24,020 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-28 08:36:24,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {4347#false} ~skip~0 := 0; {4347#false} is VALID [2022-04-28 08:36:24,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {4347#false} assume !false; {4347#false} is VALID [2022-04-28 08:36:24,021 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-28 08:36:24,021 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-28 08:36:24,021 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-28 08:36:24,021 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-28 08:36:24,021 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-28 08:36:24,021 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-28 08:36:24,022 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-28 08:36:24,022 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-28 08:36:24,022 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-28 08:36:24,022 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-28 08:36:24,022 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-28 08:36:24,022 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-28 08:36:24,023 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-28 08:36:24,023 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-28 08:36:24,023 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-28 08:36:24,023 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-28 08:36:24,023 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-28 08:36:24,023 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-28 08:36:24,023 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-28 08:36:24,023 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-28 08:36:24,023 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-28 08:36:24,024 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-28 08:36:24,027 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-28 08:36:24,028 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-28 08:36:24,033 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-28 08:36:24,034 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-28 08:36:24,034 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-28 08:36:24,034 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-28 08:36:24,034 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-28 08:36:24,035 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-28 08:36:24,035 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-28 08:36:24,035 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-28 08:36:24,035 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-28 08:36:24,035 INFO L290 TraceCheckUtils]: 62: Hoare triple {4347#false} assume 8672 == #t~mem74;havoc #t~mem74; {4347#false} is VALID [2022-04-28 08:36:24,035 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-28 08:36:24,035 INFO L290 TraceCheckUtils]: 64: Hoare triple {4347#false} assume 4 == ~blastFlag~0; {4347#false} is VALID [2022-04-28 08:36:24,035 INFO L290 TraceCheckUtils]: 65: Hoare triple {4347#false} assume !false; {4347#false} is VALID [2022-04-28 08:36:24,036 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-28 08:36:24,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:36:24,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573832609] [2022-04-28 08:36:24,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573832609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:24,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:24,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:24,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:36:24,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [721919363] [2022-04-28 08:36:24,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [721919363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:24,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:24,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:24,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172280383] [2022-04-28 08:36:24,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:36:24,038 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-28 08:36:24,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:36:24,038 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-28 08:36:24,087 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-28 08:36:24,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:36:24,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:24,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:36:24,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:36:24,089 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-28 08:36:26,111 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-28 08:36:27,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:27,135 INFO L93 Difference]: Finished difference Result 322 states and 488 transitions. [2022-04-28 08:36:27,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:36:27,141 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-28 08:36:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:27,141 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-28 08:36:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-28 08:36:27,152 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-28 08:36:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-28 08:36:27,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 432 transitions. [2022-04-28 08:36:27,472 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-28 08:36:27,477 INFO L225 Difference]: With dead ends: 322 [2022-04-28 08:36:27,477 INFO L226 Difference]: Without dead ends: 181 [2022-04-28 08:36:27,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:36:27,483 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 20 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:36:27,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 468 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 347 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:36:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-28 08:36:27,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 167. [2022-04-28 08:36:27,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:27,501 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-28 08:36:27,501 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-28 08:36:27,502 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-28 08:36:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:27,509 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2022-04-28 08:36:27,509 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2022-04-28 08:36:27,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:27,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:27,510 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-28 08:36:27,511 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-28 08:36:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:27,514 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2022-04-28 08:36:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2022-04-28 08:36:27,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:27,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:27,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:27,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:27,516 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-28 08:36:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 252 transitions. [2022-04-28 08:36:27,519 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 252 transitions. Word has length 66 [2022-04-28 08:36:27,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:27,520 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 252 transitions. [2022-04-28 08:36:27,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:27,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 252 transitions. [2022-04-28 08:36:27,712 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-28 08:36:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-28 08:36:27,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 08:36:27,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:27,713 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:36:27,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:36:27,714 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:27,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:27,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2086075870, now seen corresponding path program 1 times [2022-04-28 08:36:27,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:27,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1975819513] [2022-04-28 08:36:27,740 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:36:27,740 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:36:27,740 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:36:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2086075870, now seen corresponding path program 2 times [2022-04-28 08:36:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:27,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768405963] [2022-04-28 08:36:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:27,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:27,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:36:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:27,911 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-28 08:36:27,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {5698#true} assume true; {5698#true} is VALID [2022-04-28 08:36:27,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5698#true} {5698#true} #664#return; {5698#true} is VALID [2022-04-28 08:36:27,912 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-28 08:36:27,912 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-28 08:36:27,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {5698#true} assume true; {5698#true} is VALID [2022-04-28 08:36:27,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5698#true} {5698#true} #664#return; {5698#true} is VALID [2022-04-28 08:36:27,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {5698#true} call #t~ret162 := main(); {5698#true} is VALID [2022-04-28 08:36:27,912 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-28 08:36:27,913 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-28 08:36:27,913 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-28 08:36:27,915 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-28 08:36:27,917 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-28 08:36:27,917 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-28 08:36:27,918 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-28 08:36:27,918 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-28 08:36:27,919 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-28 08:36:27,919 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-28 08:36:27,920 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-28 08:36:27,920 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-28 08:36:27,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {5699#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {5699#false} is VALID [2022-04-28 08:36:27,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {5699#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {5699#false} is VALID [2022-04-28 08:36:27,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {5699#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {5699#false} is VALID [2022-04-28 08:36:27,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {5699#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {5699#false} is VALID [2022-04-28 08:36:27,921 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-28 08:36:27,921 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-28 08:36:27,921 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-28 08:36:27,921 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-28 08:36:27,921 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-28 08:36:27,922 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-28 08:36:27,922 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-28 08:36:27,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {5699#false} ~skip~0 := 0; {5699#false} is VALID [2022-04-28 08:36:27,922 INFO L290 TraceCheckUtils]: 29: Hoare triple {5699#false} assume !false; {5699#false} is VALID [2022-04-28 08:36:27,922 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-28 08:36:27,922 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-28 08:36:27,922 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-28 08:36:27,922 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-28 08:36:27,923 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-28 08:36:27,923 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-28 08:36:27,923 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-28 08:36:27,923 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-28 08:36:27,923 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-28 08:36:27,923 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-28 08:36:27,924 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-28 08:36:27,924 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-28 08:36:27,925 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-28 08:36:27,925 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-28 08:36:27,925 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-28 08:36:27,925 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-28 08:36:27,925 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-28 08:36:27,925 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-28 08:36:27,925 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-28 08:36:27,925 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-28 08:36:27,925 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-28 08:36:27,926 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-28 08:36:27,926 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-28 08:36:27,926 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-28 08:36:27,926 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-28 08:36:27,926 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-28 08:36:27,926 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-28 08:36:27,926 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-28 08:36:27,926 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-28 08:36:27,926 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-28 08:36:27,927 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-28 08:36:27,927 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-28 08:36:27,927 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-28 08:36:27,927 INFO L290 TraceCheckUtils]: 63: Hoare triple {5699#false} assume 8672 == #t~mem74;havoc #t~mem74; {5699#false} is VALID [2022-04-28 08:36:27,927 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-28 08:36:27,927 INFO L290 TraceCheckUtils]: 65: Hoare triple {5699#false} assume 4 == ~blastFlag~0; {5699#false} is VALID [2022-04-28 08:36:27,927 INFO L290 TraceCheckUtils]: 66: Hoare triple {5699#false} assume !false; {5699#false} is VALID [2022-04-28 08:36:27,929 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-28 08:36:27,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:36:27,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768405963] [2022-04-28 08:36:27,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768405963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:27,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:27,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:27,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:36:27,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1975819513] [2022-04-28 08:36:27,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1975819513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:27,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:27,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:27,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578406784] [2022-04-28 08:36:27,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:36:27,934 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-28 08:36:27,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:36:27,935 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-28 08:36:27,993 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-28 08:36:27,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:36:27,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:27,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:36:27,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:36:27,998 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-28 08:36:30,023 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-28 08:36:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:30,979 INFO L93 Difference]: Finished difference Result 321 states and 486 transitions. [2022-04-28 08:36:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:36:30,979 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-28 08:36:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:30,979 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-28 08:36:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-28 08:36:30,983 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-28 08:36:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-28 08:36:30,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 430 transitions. [2022-04-28 08:36:31,330 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-28 08:36:31,333 INFO L225 Difference]: With dead ends: 321 [2022-04-28 08:36:31,334 INFO L226 Difference]: Without dead ends: 180 [2022-04-28 08:36:31,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:36:31,335 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 26 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:36:31,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:36:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-28 08:36:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2022-04-28 08:36:31,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:31,343 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-28 08:36:31,343 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-28 08:36:31,344 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-28 08:36:31,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:31,347 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-28 08:36:31,347 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-28 08:36:31,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:31,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:31,348 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-28 08:36:31,349 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-28 08:36:31,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:31,352 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-28 08:36:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-28 08:36:31,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:31,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:31,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:31,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:31,353 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-28 08:36:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 251 transitions. [2022-04-28 08:36:31,357 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 251 transitions. Word has length 67 [2022-04-28 08:36:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:31,357 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 251 transitions. [2022-04-28 08:36:31,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:31,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 251 transitions. [2022-04-28 08:36:31,540 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-28 08:36:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 251 transitions. [2022-04-28 08:36:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 08:36:31,541 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:31,541 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:36:31,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:36:31,541 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:31,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1877545714, now seen corresponding path program 1 times [2022-04-28 08:36:31,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:31,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [233760071] [2022-04-28 08:36:31,736 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-28 08:36:31,737 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:36:31,738 INFO L85 PathProgramCache]: Analyzing trace with hash 809606660, now seen corresponding path program 1 times [2022-04-28 08:36:31,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:31,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630143687] [2022-04-28 08:36:31,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:31,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:31,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:36:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:31,856 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-28 08:36:31,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {7046#true} assume true; {7046#true} is VALID [2022-04-28 08:36:31,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7046#true} {7046#true} #664#return; {7046#true} is VALID [2022-04-28 08:36:31,857 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-28 08:36:31,857 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-28 08:36:31,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {7046#true} assume true; {7046#true} is VALID [2022-04-28 08:36:31,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7046#true} {7046#true} #664#return; {7046#true} is VALID [2022-04-28 08:36:31,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {7046#true} call #t~ret162 := main(); {7046#true} is VALID [2022-04-28 08:36:31,863 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-28 08:36:31,863 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-28 08:36:31,863 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-28 08:36:31,864 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-28 08:36:31,864 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-28 08:36:31,864 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-28 08:36:31,865 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-28 08:36:31,865 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-28 08:36:31,865 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-28 08:36:31,866 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-28 08:36:31,867 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-28 08:36:31,867 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-28 08:36:31,867 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-28 08:36:31,868 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-28 08:36:31,868 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-28 08:36:31,868 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-28 08:36:31,869 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-28 08:36:31,869 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-28 08:36:31,869 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-28 08:36:31,870 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-28 08:36:31,870 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-28 08:36:31,870 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-28 08:36:31,871 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-28 08:36:31,871 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-28 08:36:31,871 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-28 08:36:31,872 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-28 08:36:31,872 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-28 08:36:31,872 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-28 08:36:31,873 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-28 08:36:31,873 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-28 08:36:31,873 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-28 08:36:31,874 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-28 08:36:31,874 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-28 08:36:31,874 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-28 08:36:31,877 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-28 08:36:31,878 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-28 08:36:31,879 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-28 08:36:31,880 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-28 08:36:31,880 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-28 08:36:31,880 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-28 08:36:31,881 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-28 08:36:31,881 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-28 08:36:31,883 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-28 08:36:31,884 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-28 08:36:31,886 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-28 08:36:31,886 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-28 08:36:31,887 INFO L290 TraceCheckUtils]: 51: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {7047#false} is VALID [2022-04-28 08:36:31,887 INFO L290 TraceCheckUtils]: 52: Hoare triple {7047#false} assume !false; {7047#false} is VALID [2022-04-28 08:36:31,888 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-28 08:36:31,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:36:31,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630143687] [2022-04-28 08:36:31,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630143687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:31,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:31,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:36:36,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:36:36,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [233760071] [2022-04-28 08:36:36,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [233760071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:36,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:36,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 08:36:36,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057877422] [2022-04-28 08:36:36,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:36:36,088 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-28 08:36:36,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:36:36,089 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-28 08:36:36,170 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-28 08:36:36,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 08:36:36,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:36,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 08:36:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=125, Unknown=1, NotChecked=0, Total=182 [2022-04-28 08:36:36,171 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-28 08:36:38,211 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-28 08:36:39,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:39,553 INFO L93 Difference]: Finished difference Result 319 states and 482 transitions. [2022-04-28 08:36:39,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 08:36:39,553 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-28 08:36:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:39,553 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-28 08:36:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 426 transitions. [2022-04-28 08:36:39,557 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-28 08:36:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 426 transitions. [2022-04-28 08:36:39,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 426 transitions. [2022-04-28 08:36:39,878 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-28 08:36:39,883 INFO L225 Difference]: With dead ends: 319 [2022-04-28 08:36:39,883 INFO L226 Difference]: Without dead ends: 178 [2022-04-28 08:36:39,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=56, Invalid=125, Unknown=1, NotChecked=0, Total=182 [2022-04-28 08:36:39,885 INFO L413 NwaCegarLoop]: 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-28 08:36:39,885 INFO L414 NwaCegarLoop]: 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-28 08:36:39,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-28 08:36:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2022-04-28 08:36:39,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:39,900 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-28 08:36:39,901 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-28 08:36:39,901 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-28 08:36:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:39,904 INFO L93 Difference]: Finished difference Result 178 states and 264 transitions. [2022-04-28 08:36:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 264 transitions. [2022-04-28 08:36:39,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:39,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:39,905 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-28 08:36:39,906 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-28 08:36:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:39,909 INFO L93 Difference]: Finished difference Result 178 states and 264 transitions. [2022-04-28 08:36:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 264 transitions. [2022-04-28 08:36:39,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:39,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:39,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:39,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:39,910 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-28 08:36:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 261 transitions. [2022-04-28 08:36:39,914 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 261 transitions. Word has length 67 [2022-04-28 08:36:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:39,914 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 261 transitions. [2022-04-28 08:36:39,914 INFO L496 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-28 08:36:39,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 261 transitions. [2022-04-28 08:36:40,109 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-28 08:36:40,109 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 261 transitions. [2022-04-28 08:36:40,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 08:36:40,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:40,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:36:40,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:36:40,110 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:40,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:40,111 INFO L85 PathProgramCache]: Analyzing trace with hash 61616332, now seen corresponding path program 1 times [2022-04-28 08:36:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:40,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2036684175] [2022-04-28 08:36:40,264 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-28 08:36:40,265 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:36:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2065119804, now seen corresponding path program 1 times [2022-04-28 08:36:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:40,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894762053] [2022-04-28 08:36:40,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:40,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:40,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:36:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:40,378 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-28 08:36:40,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {8409#true} assume true; {8409#true} is VALID [2022-04-28 08:36:40,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8409#true} {8409#true} #664#return; {8409#true} is VALID [2022-04-28 08:36:40,379 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-28 08:36:40,379 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-28 08:36:40,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {8409#true} assume true; {8409#true} is VALID [2022-04-28 08:36:40,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8409#true} {8409#true} #664#return; {8409#true} is VALID [2022-04-28 08:36:40,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {8409#true} call #t~ret162 := main(); {8409#true} is VALID [2022-04-28 08:36:40,380 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-28 08:36:40,380 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-28 08:36:40,380 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-28 08:36:40,380 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-28 08:36:40,381 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-28 08:36:40,381 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-28 08:36:40,381 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-28 08:36:40,382 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-28 08:36:40,382 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-28 08:36:40,382 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-28 08:36:40,383 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-28 08:36:40,383 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-28 08:36:40,383 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-28 08:36:40,384 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-28 08:36:40,384 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-28 08:36:40,384 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-28 08:36:40,385 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-28 08:36:40,385 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-28 08:36:40,385 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-28 08:36:40,386 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-28 08:36:40,386 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-28 08:36:40,386 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-28 08:36:40,387 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-28 08:36:40,387 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-28 08:36:40,387 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-28 08:36:40,388 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-28 08:36:40,388 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-28 08:36:40,388 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-28 08:36:40,389 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-28 08:36:40,389 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-28 08:36:40,389 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-28 08:36:40,390 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-28 08:36:40,390 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-28 08:36:40,390 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-28 08:36:40,391 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-28 08:36:40,391 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-28 08:36:40,391 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-28 08:36:40,392 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-28 08:36:40,392 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-28 08:36:40,392 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-28 08:36:40,393 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-28 08:36:40,393 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-28 08:36:40,393 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-28 08:36:40,394 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-28 08:36:40,394 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-28 08:36:40,394 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-28 08:36:40,395 INFO L290 TraceCheckUtils]: 51: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {8410#false} is VALID [2022-04-28 08:36:40,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {8410#false} assume !false; {8410#false} is VALID [2022-04-28 08:36:40,395 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-28 08:36:40,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:36:40,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894762053] [2022-04-28 08:36:40,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894762053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:40,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:40,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:36:43,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:36:43,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2036684175] [2022-04-28 08:36:43,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2036684175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:43,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:43,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 08:36:43,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677198017] [2022-04-28 08:36:43,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:36:43,623 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-28 08:36:43,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:36:43,624 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-28 08:36:43,689 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-28 08:36:43,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 08:36:43,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:43,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 08:36:43,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=125, Unknown=1, NotChecked=0, Total=182 [2022-04-28 08:36:43,690 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-28 08:36:45,710 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-28 08:36:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:46,719 INFO L93 Difference]: Finished difference Result 327 states and 493 transitions. [2022-04-28 08:36:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 08:36:46,720 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-28 08:36:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:46,720 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-28 08:36:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 431 transitions. [2022-04-28 08:36:46,723 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-28 08:36:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 431 transitions. [2022-04-28 08:36:46,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 431 transitions. [2022-04-28 08:36:47,089 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-28 08:36:47,093 INFO L225 Difference]: With dead ends: 327 [2022-04-28 08:36:47,093 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 08:36:47,094 INFO L412 NwaCegarLoop]: 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-28 08:36:47,094 INFO L413 NwaCegarLoop]: 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-28 08:36:47,095 INFO L414 NwaCegarLoop]: 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-28 08:36:47,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 08:36:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 177. [2022-04-28 08:36:47,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:47,113 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-28 08:36:47,114 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-28 08:36:47,114 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-28 08:36:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:47,119 INFO L93 Difference]: Finished difference Result 186 states and 274 transitions. [2022-04-28 08:36:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 274 transitions. [2022-04-28 08:36:47,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:47,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:47,120 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-28 08:36:47,120 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-28 08:36:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:47,124 INFO L93 Difference]: Finished difference Result 186 states and 274 transitions. [2022-04-28 08:36:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 274 transitions. [2022-04-28 08:36:47,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:47,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:47,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:47,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:47,125 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-28 08:36:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 263 transitions. [2022-04-28 08:36:47,129 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 263 transitions. Word has length 67 [2022-04-28 08:36:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:47,129 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 263 transitions. [2022-04-28 08:36:47,129 INFO L496 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-28 08:36:47,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 263 transitions. [2022-04-28 08:36:47,428 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-28 08:36:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2022-04-28 08:36:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 08:36:47,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:47,429 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:36:47,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:36:47,429 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash -957475682, now seen corresponding path program 1 times [2022-04-28 08:36:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:47,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [298696867] [2022-04-28 08:36:47,454 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:36:47,454 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:36:47,454 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:36:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash -957475682, now seen corresponding path program 2 times [2022-04-28 08:36:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:47,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765322009] [2022-04-28 08:36:47,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:47,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:47,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:36:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:47,597 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-28 08:36:47,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {9808#true} assume true; {9808#true} is VALID [2022-04-28 08:36:47,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9808#true} {9808#true} #664#return; {9808#true} is VALID [2022-04-28 08:36:47,599 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-28 08:36:47,599 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-28 08:36:47,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {9808#true} assume true; {9808#true} is VALID [2022-04-28 08:36:47,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9808#true} {9808#true} #664#return; {9808#true} is VALID [2022-04-28 08:36:47,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {9808#true} call #t~ret162 := main(); {9808#true} is VALID [2022-04-28 08:36:47,599 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-28 08:36:47,599 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-28 08:36:47,599 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-28 08:36:47,601 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-28 08:36:47,602 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-28 08:36:47,603 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-28 08:36:47,603 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-28 08:36:47,605 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-28 08:36:47,605 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-28 08:36:47,606 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-28 08:36:47,606 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-28 08:36:47,606 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-28 08:36:47,607 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-28 08:36:47,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {9809#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {9809#false} is VALID [2022-04-28 08:36:47,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {9809#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9809#false} is VALID [2022-04-28 08:36:47,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {9809#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {9809#false} is VALID [2022-04-28 08:36:47,607 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-28 08:36:47,608 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-28 08:36:47,608 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-28 08:36:47,608 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-28 08:36:47,608 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-28 08:36:47,608 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-28 08:36:47,608 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-28 08:36:47,608 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-28 08:36:47,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {9809#false} ~skip~0 := 0; {9809#false} is VALID [2022-04-28 08:36:47,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {9809#false} assume !false; {9809#false} is VALID [2022-04-28 08:36:47,608 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-28 08:36:47,609 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-28 08:36:47,609 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-28 08:36:47,609 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-28 08:36:47,609 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-28 08:36:47,609 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-28 08:36:47,609 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-28 08:36:47,609 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-28 08:36:47,609 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-28 08:36:47,609 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-28 08:36:47,609 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-28 08:36:47,610 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-28 08:36:47,610 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-28 08:36:47,610 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-28 08:36:47,610 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-28 08:36:47,610 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-28 08:36:47,610 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-28 08:36:47,610 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-28 08:36:47,610 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-28 08:36:47,610 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-28 08:36:47,611 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-28 08:36:47,611 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-28 08:36:47,611 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-28 08:36:47,611 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-28 08:36:47,611 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-28 08:36:47,611 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-28 08:36:47,611 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-28 08:36:47,611 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-28 08:36:47,611 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-28 08:36:47,611 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-28 08:36:47,612 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-28 08:36:47,612 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-28 08:36:47,612 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-28 08:36:47,612 INFO L290 TraceCheckUtils]: 64: Hoare triple {9809#false} assume 8672 == #t~mem74;havoc #t~mem74; {9809#false} is VALID [2022-04-28 08:36:47,612 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-28 08:36:47,612 INFO L290 TraceCheckUtils]: 66: Hoare triple {9809#false} assume 4 == ~blastFlag~0; {9809#false} is VALID [2022-04-28 08:36:47,612 INFO L290 TraceCheckUtils]: 67: Hoare triple {9809#false} assume !false; {9809#false} is VALID [2022-04-28 08:36:47,613 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-28 08:36:47,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:36:47,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765322009] [2022-04-28 08:36:47,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765322009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:47,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:47,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:47,613 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:36:47,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [298696867] [2022-04-28 08:36:47,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [298696867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:47,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:47,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:47,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016885504] [2022-04-28 08:36:47,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:36:47,614 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-28 08:36:47,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:36:47,615 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-28 08:36:47,678 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-28 08:36:47,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:36:47,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:47,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:36:47,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:36:47,679 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-28 08:36:49,706 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-28 08:36:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:50,774 INFO L93 Difference]: Finished difference Result 329 states and 494 transitions. [2022-04-28 08:36:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:36:50,775 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-28 08:36:50,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:50,775 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-28 08:36:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-28 08:36:50,778 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-28 08:36:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-28 08:36:50,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 428 transitions. [2022-04-28 08:36:51,128 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-28 08:36:51,131 INFO L225 Difference]: With dead ends: 329 [2022-04-28 08:36:51,131 INFO L226 Difference]: Without dead ends: 180 [2022-04-28 08:36:51,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:36:51,132 INFO L413 NwaCegarLoop]: 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-28 08:36:51,132 INFO L414 NwaCegarLoop]: 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-28 08:36:51,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-28 08:36:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 169. [2022-04-28 08:36:51,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:51,138 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-28 08:36:51,138 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-28 08:36:51,140 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-28 08:36:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:51,142 INFO L93 Difference]: Finished difference Result 180 states and 266 transitions. [2022-04-28 08:36:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 266 transitions. [2022-04-28 08:36:51,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:51,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:51,143 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-28 08:36:51,143 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-28 08:36:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:51,147 INFO L93 Difference]: Finished difference Result 180 states and 266 transitions. [2022-04-28 08:36:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 266 transitions. [2022-04-28 08:36:51,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:51,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:51,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:51,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:51,148 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-28 08:36:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2022-04-28 08:36:51,151 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 252 transitions. Word has length 68 [2022-04-28 08:36:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:51,151 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 252 transitions. [2022-04-28 08:36:51,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:51,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 252 transitions. [2022-04-28 08:36:51,362 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-28 08:36:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 252 transitions. [2022-04-28 08:36:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 08:36:51,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:51,363 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:36:51,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:36:51,363 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:51,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:51,364 INFO L85 PathProgramCache]: Analyzing trace with hash -175906935, now seen corresponding path program 1 times [2022-04-28 08:36:51,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:51,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [293598857] [2022-04-28 08:36:51,546 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-28 08:36:51,546 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:36:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash -644878972, now seen corresponding path program 1 times [2022-04-28 08:36:51,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:51,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733872547] [2022-04-28 08:36:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:51,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:51,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:36:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:51,676 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-28 08:36:51,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {11176#true} assume true; {11176#true} is VALID [2022-04-28 08:36:51,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11176#true} {11176#true} #664#return; {11176#true} is VALID [2022-04-28 08:36:51,677 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-28 08:36:51,677 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-28 08:36:51,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {11176#true} assume true; {11176#true} is VALID [2022-04-28 08:36:51,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11176#true} {11176#true} #664#return; {11176#true} is VALID [2022-04-28 08:36:51,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {11176#true} call #t~ret162 := main(); {11176#true} is VALID [2022-04-28 08:36:51,678 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-28 08:36:51,678 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-28 08:36:51,678 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-28 08:36:51,678 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-28 08:36:51,679 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-28 08:36:51,679 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-28 08:36:51,679 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-28 08:36:51,679 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-28 08:36:51,680 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-28 08:36:51,680 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-28 08:36:51,681 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-28 08:36:51,681 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-28 08:36:51,681 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-28 08:36:51,682 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-28 08:36:51,682 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-28 08:36:51,682 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-28 08:36:51,683 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-28 08:36:51,683 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-28 08:36:51,683 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-28 08:36:51,684 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-28 08:36:51,684 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-28 08:36:51,684 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-28 08:36:51,684 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-28 08:36:51,685 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-28 08:36:51,685 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-28 08:36:51,685 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-28 08:36:51,686 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-28 08:36:51,686 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-28 08:36:51,686 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-28 08:36:51,687 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-28 08:36:51,687 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-28 08:36:51,687 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-28 08:36:51,688 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-28 08:36:51,688 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-28 08:36:51,688 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-28 08:36:51,688 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-28 08:36:51,689 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-28 08:36:51,689 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-28 08:36:51,689 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-28 08:36:51,690 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-28 08:36:51,690 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-28 08:36:51,690 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-28 08:36:51,691 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-28 08:36:51,691 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-28 08:36:51,691 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-28 08:36:51,692 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-28 08:36:51,692 INFO L290 TraceCheckUtils]: 51: Hoare triple {11181#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {11177#false} is VALID [2022-04-28 08:36:51,692 INFO L290 TraceCheckUtils]: 52: Hoare triple {11177#false} assume !false; {11177#false} is VALID [2022-04-28 08:36:51,692 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-28 08:36:51,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:36:51,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733872547] [2022-04-28 08:36:51,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733872547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:51,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:51,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:36:55,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:36:55,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [293598857] [2022-04-28 08:36:55,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [293598857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:55,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:55,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 08:36:55,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250629633] [2022-04-28 08:36:55,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:36:55,347 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-28 08:36:55,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:36:55,348 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-28 08:36:55,417 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-28 08:36:55,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 08:36:55,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:55,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 08:36:55,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=150, Unknown=1, NotChecked=0, Total=210 [2022-04-28 08:36:55,418 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-28 08:36:57,464 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-28 08:36:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:59,157 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2022-04-28 08:36:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 08:36:59,157 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-28 08:36:59,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:59,157 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-28 08:36:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 425 transitions. [2022-04-28 08:36:59,160 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-28 08:36:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 425 transitions. [2022-04-28 08:36:59,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 425 transitions. [2022-04-28 08:36:59,533 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-28 08:36:59,536 INFO L225 Difference]: With dead ends: 320 [2022-04-28 08:36:59,536 INFO L226 Difference]: Without dead ends: 179 [2022-04-28 08:36:59,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=59, Invalid=150, Unknown=1, NotChecked=0, Total=210 [2022-04-28 08:36:59,537 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 12 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:36:59,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 820 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 535 Invalid, 1 Unknown, 253 Unchecked, 2.6s Time] [2022-04-28 08:36:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-28 08:36:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2022-04-28 08:36:59,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:59,547 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-28 08:36:59,548 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-28 08:36:59,548 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-28 08:36:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:59,552 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2022-04-28 08:36:59,552 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 264 transitions. [2022-04-28 08:36:59,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:59,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:59,553 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-28 08:36:59,553 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-28 08:36:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:59,556 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2022-04-28 08:36:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 264 transitions. [2022-04-28 08:36:59,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:59,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:59,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:59,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:59,557 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-28 08:36:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2022-04-28 08:36:59,561 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 68 [2022-04-28 08:36:59,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:59,561 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2022-04-28 08:36:59,561 INFO L496 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-28 08:36:59,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 262 transitions. [2022-04-28 08:36:59,777 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-28 08:36:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2022-04-28 08:36:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 08:36:59,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:59,779 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:36:59,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:36:59,779 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:59,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:59,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1763255111, now seen corresponding path program 1 times [2022-04-28 08:36:59,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:59,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1546265680] [2022-04-28 08:36:59,966 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-28 08:36:59,966 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:36:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash 775361860, now seen corresponding path program 1 times [2022-04-28 08:36:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:59,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6912427] [2022-04-28 08:36:59,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:59,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:37:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:00,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:37:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:00,088 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-28 08:37:00,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {12548#true} assume true; {12548#true} is VALID [2022-04-28 08:37:00,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12548#true} {12548#true} #664#return; {12548#true} is VALID [2022-04-28 08:37:00,089 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-28 08:37:00,090 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-28 08:37:00,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {12548#true} assume true; {12548#true} is VALID [2022-04-28 08:37:00,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12548#true} {12548#true} #664#return; {12548#true} is VALID [2022-04-28 08:37:00,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {12548#true} call #t~ret162 := main(); {12548#true} is VALID [2022-04-28 08:37:00,090 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-28 08:37:00,090 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-28 08:37:00,090 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-28 08:37:00,091 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-28 08:37:00,091 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-28 08:37:00,091 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-28 08:37:00,092 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-28 08:37:00,092 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-28 08:37:00,092 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-28 08:37:00,093 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-28 08:37:00,093 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-28 08:37:00,094 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-28 08:37:00,094 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-28 08:37:00,094 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-28 08:37:00,095 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-28 08:37:00,095 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-28 08:37:00,095 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-28 08:37:00,096 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-28 08:37:00,096 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-28 08:37:00,096 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-28 08:37:00,097 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-28 08:37:00,097 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-28 08:37:00,097 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-28 08:37:00,098 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-28 08:37:00,098 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-28 08:37:00,098 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-28 08:37:00,099 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-28 08:37:00,099 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-28 08:37:00,099 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-28 08:37:00,099 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-28 08:37:00,100 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-28 08:37:00,100 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-28 08:37:00,100 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-28 08:37:00,101 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-28 08:37:00,101 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-28 08:37:00,101 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-28 08:37:00,102 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-28 08:37:00,102 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-28 08:37:00,102 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-28 08:37:00,103 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-28 08:37:00,103 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-28 08:37:00,103 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-28 08:37:00,104 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-28 08:37:00,104 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-28 08:37:00,104 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-28 08:37:00,105 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-28 08:37:00,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {12553#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {12549#false} is VALID [2022-04-28 08:37:00,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {12549#false} assume !false; {12549#false} is VALID [2022-04-28 08:37:00,106 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-28 08:37:00,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:37:00,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6912427] [2022-04-28 08:37:00,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6912427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:00,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:00,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:37:04,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:37:04,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1546265680] [2022-04-28 08:37:04,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1546265680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:04,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:04,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 08:37:04,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36979853] [2022-04-28 08:37:04,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:37:04,064 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-28 08:37:04,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:37:04,064 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-28 08:37:04,135 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-28 08:37:04,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 08:37:04,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:04,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 08:37:04,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=150, Unknown=1, NotChecked=0, Total=210 [2022-04-28 08:37:04,136 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-28 08:37:06,171 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-28 08:37:07,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:07,513 INFO L93 Difference]: Finished difference Result 325 states and 488 transitions. [2022-04-28 08:37:07,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 08:37:07,515 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-28 08:37:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:37:07,516 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-28 08:37:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 425 transitions. [2022-04-28 08:37:07,519 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-28 08:37:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 425 transitions. [2022-04-28 08:37:07,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 425 transitions. [2022-04-28 08:37:07,901 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-28 08:37:07,904 INFO L225 Difference]: With dead ends: 325 [2022-04-28 08:37:07,904 INFO L226 Difference]: Without dead ends: 184 [2022-04-28 08:37:07,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=59, Invalid=150, Unknown=1, NotChecked=0, Total=210 [2022-04-28 08:37:07,905 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 11 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:37:07,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 680 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 448 Invalid, 1 Unknown, 143 Unchecked, 2.4s Time] [2022-04-28 08:37:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-28 08:37:07,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 177. [2022-04-28 08:37:07,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:37:07,917 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-28 08:37:07,918 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-28 08:37:07,919 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-28 08:37:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:07,922 INFO L93 Difference]: Finished difference Result 184 states and 270 transitions. [2022-04-28 08:37:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 270 transitions. [2022-04-28 08:37:07,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:07,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:07,924 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-28 08:37:07,924 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-28 08:37:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:07,927 INFO L93 Difference]: Finished difference Result 184 states and 270 transitions. [2022-04-28 08:37:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 270 transitions. [2022-04-28 08:37:07,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:07,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:07,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:37:07,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:37:07,928 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-28 08:37:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2022-04-28 08:37:07,932 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 68 [2022-04-28 08:37:07,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:37:07,932 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2022-04-28 08:37:07,932 INFO L496 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-28 08:37:07,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 262 transitions. [2022-04-28 08:37:08,177 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-28 08:37:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2022-04-28 08:37:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 08:37:08,178 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:37:08,178 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:37:08,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:37:08,179 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:37:08,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:37:08,179 INFO L85 PathProgramCache]: Analyzing trace with hash 253718915, now seen corresponding path program 1 times [2022-04-28 08:37:08,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:08,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [377977363] [2022-04-28 08:37:08,203 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:37:08,203 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:37:08,203 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:37:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash 253718915, now seen corresponding path program 2 times [2022-04-28 08:37:08,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:37:08,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594378786] [2022-04-28 08:37:08,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:37:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:37:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:37:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:08,349 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-28 08:37:08,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {13940#true} assume true; {13940#true} is VALID [2022-04-28 08:37:08,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13940#true} {13940#true} #664#return; {13940#true} is VALID [2022-04-28 08:37:08,350 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-28 08:37:08,350 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-28 08:37:08,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {13940#true} assume true; {13940#true} is VALID [2022-04-28 08:37:08,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13940#true} {13940#true} #664#return; {13940#true} is VALID [2022-04-28 08:37:08,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {13940#true} call #t~ret162 := main(); {13940#true} is VALID [2022-04-28 08:37:08,351 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-28 08:37:08,351 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-28 08:37:08,351 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-28 08:37:08,353 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-28 08:37:08,354 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-28 08:37:08,354 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-28 08:37:08,355 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-28 08:37:08,355 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-28 08:37:08,356 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-28 08:37:08,356 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-28 08:37:08,357 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-28 08:37:08,357 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-28 08:37:08,358 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-28 08:37:08,358 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-28 08:37:08,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {13941#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {13941#false} is VALID [2022-04-28 08:37:08,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {13941#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13941#false} is VALID [2022-04-28 08:37:08,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {13941#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {13941#false} is VALID [2022-04-28 08:37:08,359 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-28 08:37:08,359 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-28 08:37:08,359 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-28 08:37:08,359 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-28 08:37:08,359 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-28 08:37:08,359 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-28 08:37:08,359 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-28 08:37:08,359 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-28 08:37:08,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {13941#false} ~skip~0 := 0; {13941#false} is VALID [2022-04-28 08:37:08,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {13941#false} assume !false; {13941#false} is VALID [2022-04-28 08:37:08,360 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-28 08:37:08,360 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-28 08:37:08,360 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-28 08:37:08,360 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-28 08:37:08,360 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-28 08:37:08,360 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-28 08:37:08,360 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-28 08:37:08,360 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-28 08:37:08,360 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-28 08:37:08,360 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-28 08:37:08,361 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-28 08:37:08,361 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-28 08:37:08,361 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-28 08:37:08,361 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-28 08:37:08,361 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-28 08:37:08,361 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-28 08:37:08,361 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-28 08:37:08,361 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-28 08:37:08,361 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-28 08:37:08,361 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-28 08:37:08,361 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-28 08:37:08,362 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-28 08:37:08,362 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-28 08:37:08,362 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-28 08:37:08,362 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-28 08:37:08,362 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-28 08:37:08,362 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-28 08:37:08,362 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-28 08:37:08,362 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-28 08:37:08,362 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-28 08:37:08,362 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-28 08:37:08,363 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-28 08:37:08,363 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-28 08:37:08,363 INFO L290 TraceCheckUtils]: 65: Hoare triple {13941#false} assume 8672 == #t~mem74;havoc #t~mem74; {13941#false} is VALID [2022-04-28 08:37:08,363 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-28 08:37:08,363 INFO L290 TraceCheckUtils]: 67: Hoare triple {13941#false} assume 4 == ~blastFlag~0; {13941#false} is VALID [2022-04-28 08:37:08,363 INFO L290 TraceCheckUtils]: 68: Hoare triple {13941#false} assume !false; {13941#false} is VALID [2022-04-28 08:37:08,363 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-28 08:37:08,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:37:08,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594378786] [2022-04-28 08:37:08,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594378786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:08,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:08,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:08,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:37:08,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [377977363] [2022-04-28 08:37:08,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [377977363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:08,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:08,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:08,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145774345] [2022-04-28 08:37:08,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:37:08,365 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-28 08:37:08,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:37:08,366 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-28 08:37:08,425 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-28 08:37:08,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:37:08,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:08,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:37:08,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:37:08,427 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-28 08:37:10,452 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-28 08:37:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:11,441 INFO L93 Difference]: Finished difference Result 329 states and 493 transitions. [2022-04-28 08:37:11,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:37:11,441 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-28 08:37:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:37:11,442 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-28 08:37:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-28 08:37:11,445 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-28 08:37:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-28 08:37:11,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-28 08:37:11,791 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-28 08:37:11,794 INFO L225 Difference]: With dead ends: 329 [2022-04-28 08:37:11,794 INFO L226 Difference]: Without dead ends: 180 [2022-04-28 08:37:11,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:37:11,795 INFO L413 NwaCegarLoop]: 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-28 08:37:11,795 INFO L414 NwaCegarLoop]: 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-28 08:37:11,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-28 08:37:11,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 169. [2022-04-28 08:37:11,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:37:11,800 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-28 08:37:11,801 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-28 08:37:11,801 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-28 08:37:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:11,805 INFO L93 Difference]: Finished difference Result 180 states and 265 transitions. [2022-04-28 08:37:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 265 transitions. [2022-04-28 08:37:11,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:11,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:11,807 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-28 08:37:11,823 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-28 08:37:11,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:11,827 INFO L93 Difference]: Finished difference Result 180 states and 265 transitions. [2022-04-28 08:37:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 265 transitions. [2022-04-28 08:37:11,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:11,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:11,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:37:11,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:37:11,828 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-28 08:37:11,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2022-04-28 08:37:11,832 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 69 [2022-04-28 08:37:11,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:37:11,832 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2022-04-28 08:37:11,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:11,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 251 transitions. [2022-04-28 08:37:12,043 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-28 08:37:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2022-04-28 08:37:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 08:37:12,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:37:12,044 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:37:12,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:37:12,045 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:37:12,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:37:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash -167412983, now seen corresponding path program 1 times [2022-04-28 08:37:12,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:12,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [933691324] [2022-04-28 08:37:12,233 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-28 08:37:12,234 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:37:12,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2099364604, now seen corresponding path program 1 times [2022-04-28 08:37:12,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:37:12,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289574916] [2022-04-28 08:37:12,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:37:12,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:37:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:12,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:37:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:12,362 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-28 08:37:12,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {15308#true} assume true; {15308#true} is VALID [2022-04-28 08:37:12,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15308#true} {15308#true} #664#return; {15308#true} is VALID [2022-04-28 08:37:12,363 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-28 08:37:12,363 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-28 08:37:12,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {15308#true} assume true; {15308#true} is VALID [2022-04-28 08:37:12,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15308#true} {15308#true} #664#return; {15308#true} is VALID [2022-04-28 08:37:12,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {15308#true} call #t~ret162 := main(); {15308#true} is VALID [2022-04-28 08:37:12,364 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-28 08:37:12,376 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-28 08:37:12,377 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-28 08:37:12,378 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-28 08:37:12,379 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-28 08:37:12,379 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-28 08:37:12,379 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-28 08:37:12,380 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-28 08:37:12,390 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-28 08:37:12,391 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-28 08:37:12,391 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-28 08:37:12,392 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-28 08:37:12,392 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-28 08:37:12,392 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-28 08:37:12,393 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-28 08:37:12,393 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-28 08:37:12,393 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-28 08:37:12,394 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-28 08:37:12,394 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-28 08:37:12,394 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-28 08:37:12,395 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-28 08:37:12,395 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-28 08:37:12,395 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-28 08:37:12,396 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-28 08:37:12,396 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-28 08:37:12,396 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-28 08:37:12,397 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-28 08:37:12,397 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-28 08:37:12,397 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-28 08:37:12,398 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-28 08:37:12,398 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-28 08:37:12,398 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-28 08:37:12,399 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-28 08:37:12,399 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-28 08:37:12,399 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-28 08:37:12,399 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-28 08:37:12,400 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-28 08:37:12,400 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-28 08:37:12,400 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-28 08:37:12,401 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-28 08:37:12,401 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-28 08:37:12,401 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-28 08:37:12,402 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-28 08:37:12,402 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-28 08:37:12,402 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-28 08:37:12,403 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-28 08:37:12,403 INFO L290 TraceCheckUtils]: 51: Hoare triple {15313#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {15309#false} is VALID [2022-04-28 08:37:12,403 INFO L290 TraceCheckUtils]: 52: Hoare triple {15309#false} assume !false; {15309#false} is VALID [2022-04-28 08:37:12,403 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-28 08:37:12,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:37:12,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289574916] [2022-04-28 08:37:12,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289574916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:12,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:12,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:37:16,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:37:16,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [933691324] [2022-04-28 08:37:16,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [933691324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:16,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:16,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 08:37:16,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654171574] [2022-04-28 08:37:16,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:37:16,978 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-28 08:37:16,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:37:16,978 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-28 08:37:17,050 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-28 08:37:17,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 08:37:17,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:17,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 08:37:17,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2022-04-28 08:37:17,051 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-28 08:37:19,085 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-28 08:37:20,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:20,315 INFO L93 Difference]: Finished difference Result 320 states and 481 transitions. [2022-04-28 08:37:20,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 08:37:20,315 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-28 08:37:20,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:37:20,315 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-28 08:37:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 424 transitions. [2022-04-28 08:37:20,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-28 08:37:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 424 transitions. [2022-04-28 08:37:20,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 424 transitions. [2022-04-28 08:37:20,688 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-28 08:37:20,692 INFO L225 Difference]: With dead ends: 320 [2022-04-28 08:37:20,692 INFO L226 Difference]: Without dead ends: 179 [2022-04-28 08:37:20,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2022-04-28 08:37:20,693 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:37:20,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 582 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 452 Invalid, 1 Unknown, 134 Unchecked, 2.4s Time] [2022-04-28 08:37:20,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-28 08:37:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2022-04-28 08:37:20,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:37:20,707 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-28 08:37:20,707 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-28 08:37:20,708 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-28 08:37:20,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:20,710 INFO L93 Difference]: Finished difference Result 179 states and 263 transitions. [2022-04-28 08:37:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 263 transitions. [2022-04-28 08:37:20,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:20,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:20,712 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-28 08:37:20,712 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-28 08:37:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:20,715 INFO L93 Difference]: Finished difference Result 179 states and 263 transitions. [2022-04-28 08:37:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 263 transitions. [2022-04-28 08:37:20,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:20,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:20,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:37:20,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:37:20,716 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-28 08:37:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 261 transitions. [2022-04-28 08:37:20,719 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 261 transitions. Word has length 69 [2022-04-28 08:37:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:37:20,719 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 261 transitions. [2022-04-28 08:37:20,719 INFO L496 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-28 08:37:20,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 261 transitions. [2022-04-28 08:37:20,954 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-28 08:37:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 261 transitions. [2022-04-28 08:37:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 08:37:20,955 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:37:20,955 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:37:20,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:37:20,955 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:37:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:37:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1771749063, now seen corresponding path program 1 times [2022-04-28 08:37:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:20,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1403931399] [2022-04-28 08:37:21,136 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-28 08:37:21,137 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:37:21,137 INFO L85 PathProgramCache]: Analyzing trace with hash -679123772, now seen corresponding path program 1 times [2022-04-28 08:37:21,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:37:21,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5070639] [2022-04-28 08:37:21,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:37:21,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:37:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:21,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:37:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:21,241 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-28 08:37:21,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {16681#true} assume true; {16681#true} is VALID [2022-04-28 08:37:21,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16681#true} {16681#true} #664#return; {16681#true} is VALID [2022-04-28 08:37:21,242 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-28 08:37:21,242 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-28 08:37:21,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {16681#true} assume true; {16681#true} is VALID [2022-04-28 08:37:21,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16681#true} {16681#true} #664#return; {16681#true} is VALID [2022-04-28 08:37:21,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {16681#true} call #t~ret162 := main(); {16681#true} is VALID [2022-04-28 08:37:21,243 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-28 08:37:21,243 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-28 08:37:21,243 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-28 08:37:21,243 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-28 08:37:21,244 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-28 08:37:21,244 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-28 08:37:21,244 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-28 08:37:21,245 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-28 08:37:21,245 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-28 08:37:21,246 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-28 08:37:21,246 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-28 08:37:21,246 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-28 08:37:21,247 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-28 08:37:21,247 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-28 08:37:21,247 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-28 08:37:21,247 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-28 08:37:21,248 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-28 08:37:21,248 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-28 08:37:21,248 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-28 08:37:21,249 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-28 08:37:21,249 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-28 08:37:21,249 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-28 08:37:21,250 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-28 08:37:21,250 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-28 08:37:21,250 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-28 08:37:21,251 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-28 08:37:21,251 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-28 08:37:21,251 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-28 08:37:21,252 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-28 08:37:21,252 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-28 08:37:21,252 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-28 08:37:21,253 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-28 08:37:21,253 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-28 08:37:21,253 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-28 08:37:21,254 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-28 08:37:21,254 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-28 08:37:21,254 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-28 08:37:21,255 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-28 08:37:21,255 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-28 08:37:21,255 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-28 08:37:21,256 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-28 08:37:21,256 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-28 08:37:21,256 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-28 08:37:21,256 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-28 08:37:21,257 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-28 08:37:21,257 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-28 08:37:21,257 INFO L290 TraceCheckUtils]: 51: Hoare triple {16686#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {16682#false} is VALID [2022-04-28 08:37:21,258 INFO L290 TraceCheckUtils]: 52: Hoare triple {16682#false} assume !false; {16682#false} is VALID [2022-04-28 08:37:21,258 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-28 08:37:21,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:37:21,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5070639] [2022-04-28 08:37:21,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5070639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:21,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:21,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:37:25,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:37:25,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1403931399] [2022-04-28 08:37:25,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1403931399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:25,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:25,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 08:37:25,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102110018] [2022-04-28 08:37:25,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:37:25,213 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-28 08:37:25,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:37:25,214 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-28 08:37:25,285 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-28 08:37:25,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 08:37:25,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:25,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 08:37:25,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2022-04-28 08:37:25,286 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-28 08:37:27,313 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-28 08:37:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:30,308 INFO L93 Difference]: Finished difference Result 464 states and 704 transitions. [2022-04-28 08:37:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 08:37:30,308 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-28 08:37:30,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:37:30,309 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-28 08:37:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 595 transitions. [2022-04-28 08:37:30,311 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-28 08:37:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 595 transitions. [2022-04-28 08:37:30,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 595 transitions. [2022-04-28 08:37:30,721 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-28 08:37:30,726 INFO L225 Difference]: With dead ends: 464 [2022-04-28 08:37:30,726 INFO L226 Difference]: Without dead ends: 323 [2022-04-28 08:37:30,726 INFO L412 NwaCegarLoop]: 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-28 08:37:30,727 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 146 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:37:30,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1190 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1076 Invalid, 1 Unknown, 193 Unchecked, 3.1s Time] [2022-04-28 08:37:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-04-28 08:37:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 315. [2022-04-28 08:37:30,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:37:30,744 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-28 08:37:30,744 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-28 08:37:30,745 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-28 08:37:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:30,751 INFO L93 Difference]: Finished difference Result 323 states and 480 transitions. [2022-04-28 08:37:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 480 transitions. [2022-04-28 08:37:30,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:30,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:30,753 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-28 08:37:30,753 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-28 08:37:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:30,759 INFO L93 Difference]: Finished difference Result 323 states and 480 transitions. [2022-04-28 08:37:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 480 transitions. [2022-04-28 08:37:30,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:30,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:30,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:37:30,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:37:30,761 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-28 08:37:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 471 transitions. [2022-04-28 08:37:30,767 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 471 transitions. Word has length 69 [2022-04-28 08:37:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:37:30,767 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 471 transitions. [2022-04-28 08:37:30,767 INFO L496 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-28 08:37:30,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 315 states and 471 transitions. [2022-04-28 08:37:31,128 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-28 08:37:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 471 transitions. [2022-04-28 08:37:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 08:37:31,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:37:31,130 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:37:31,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:37:31,130 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:37:31,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:37:31,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1642777843, now seen corresponding path program 1 times [2022-04-28 08:37:31,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:31,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1301124033] [2022-04-28 08:37:31,154 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:37:31,155 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:37:31,155 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:37:31,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1642777843, now seen corresponding path program 2 times [2022-04-28 08:37:31,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:37:31,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729527217] [2022-04-28 08:37:31,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:37:31,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:37:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:31,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:37:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:31,269 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-28 08:37:31,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {18906#true} assume true; {18906#true} is VALID [2022-04-28 08:37:31,270 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18906#true} {18906#true} #664#return; {18906#true} is VALID [2022-04-28 08:37:31,271 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-28 08:37:31,271 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-28 08:37:31,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {18906#true} assume true; {18906#true} is VALID [2022-04-28 08:37:31,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18906#true} {18906#true} #664#return; {18906#true} is VALID [2022-04-28 08:37:31,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {18906#true} call #t~ret162 := main(); {18906#true} is VALID [2022-04-28 08:37:31,271 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-28 08:37:31,271 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-28 08:37:31,271 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-28 08:37:31,272 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-28 08:37:31,272 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-28 08:37:31,272 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-28 08:37:31,272 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-28 08:37:31,272 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-28 08:37:31,272 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-28 08:37:31,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {18906#true} assume !false; {18906#true} is VALID [2022-04-28 08:37:31,272 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-28 08:37:31,272 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-28 08:37:31,272 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-28 08:37:31,273 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-28 08:37:31,273 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-28 08:37:31,273 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-28 08:37:31,273 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-28 08:37:31,273 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-28 08:37:31,273 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-28 08:37:31,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {18906#true} assume 8464 == #t~mem50;havoc #t~mem50; {18906#true} is VALID [2022-04-28 08:37:31,273 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-28 08:37:31,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {18906#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18906#true} is VALID [2022-04-28 08:37:31,275 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-28 08:37:31,275 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-28 08:37:31,275 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-28 08:37:31,276 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-28 08:37:31,276 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-28 08:37:31,277 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-28 08:37:31,277 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-28 08:37:31,277 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-28 08:37:31,278 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-28 08:37:31,278 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-28 08:37:31,279 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-28 08:37:31,279 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-28 08:37:31,279 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-28 08:37:31,280 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-28 08:37:31,280 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-28 08:37:31,281 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-28 08:37:31,281 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-28 08:37:31,281 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-28 08:37:31,282 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-28 08:37:31,282 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-28 08:37:31,282 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-28 08:37:31,282 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-28 08:37:31,282 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-28 08:37:31,282 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-28 08:37:31,282 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-28 08:37:31,282 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-28 08:37:31,282 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-28 08:37:31,282 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-28 08:37:31,283 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-28 08:37:31,283 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-28 08:37:31,283 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-28 08:37:31,283 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-28 08:37:31,283 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-28 08:37:31,283 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-28 08:37:31,283 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-28 08:37:31,283 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-28 08:37:31,283 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-28 08:37:31,283 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-28 08:37:31,283 INFO L290 TraceCheckUtils]: 65: Hoare triple {18907#false} assume 8672 == #t~mem74;havoc #t~mem74; {18907#false} is VALID [2022-04-28 08:37:31,284 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-28 08:37:31,284 INFO L290 TraceCheckUtils]: 67: Hoare triple {18907#false} assume 4 == ~blastFlag~0; {18907#false} is VALID [2022-04-28 08:37:31,284 INFO L290 TraceCheckUtils]: 68: Hoare triple {18907#false} assume !false; {18907#false} is VALID [2022-04-28 08:37:31,284 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-28 08:37:31,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:37:31,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729527217] [2022-04-28 08:37:31,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729527217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:31,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:31,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:31,285 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:37:31,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1301124033] [2022-04-28 08:37:31,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1301124033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:31,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:31,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:31,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274362352] [2022-04-28 08:37:31,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:37:31,286 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-28 08:37:31,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:37:31,286 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-28 08:37:31,346 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-28 08:37:31,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:37:31,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:31,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:37:31,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:37:31,347 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-28 08:37:33,375 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-28 08:37:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:34,481 INFO L93 Difference]: Finished difference Result 499 states and 753 transitions. [2022-04-28 08:37:34,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:37:34,481 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-28 08:37:34,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:37:34,482 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-28 08:37:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-28 08:37:34,483 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-28 08:37:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-28 08:37:34,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 462 transitions. [2022-04-28 08:37:34,789 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-28 08:37:34,797 INFO L225 Difference]: With dead ends: 499 [2022-04-28 08:37:34,797 INFO L226 Difference]: Without dead ends: 358 [2022-04-28 08:37:34,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:37:34,798 INFO L413 NwaCegarLoop]: 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-28 08:37:34,798 INFO L414 NwaCegarLoop]: 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-28 08:37:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-04-28 08:37:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 337. [2022-04-28 08:37:34,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:37:34,812 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-28 08:37:34,813 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-28 08:37:34,813 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-28 08:37:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:34,820 INFO L93 Difference]: Finished difference Result 358 states and 535 transitions. [2022-04-28 08:37:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 535 transitions. [2022-04-28 08:37:34,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:34,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:34,822 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-28 08:37:34,822 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-28 08:37:34,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:34,829 INFO L93 Difference]: Finished difference Result 358 states and 535 transitions. [2022-04-28 08:37:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 535 transitions. [2022-04-28 08:37:34,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:34,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:34,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:37:34,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:37:34,831 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-28 08:37:34,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 508 transitions. [2022-04-28 08:37:34,838 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 508 transitions. Word has length 69 [2022-04-28 08:37:34,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:37:34,838 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 508 transitions. [2022-04-28 08:37:34,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:34,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 337 states and 508 transitions. [2022-04-28 08:37:35,223 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-28 08:37:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 508 transitions. [2022-04-28 08:37:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 08:37:35,224 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:37:35,224 INFO L195 NwaCegarLoop]: 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-28 08:37:35,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:37:35,224 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:37:35,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:37:35,225 INFO L85 PathProgramCache]: Analyzing trace with hash -299545146, now seen corresponding path program 1 times [2022-04-28 08:37:35,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:35,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1949399205] [2022-04-28 08:37:35,272 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:37:35,272 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:37:35,272 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:37:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash -299545146, now seen corresponding path program 2 times [2022-04-28 08:37:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:37:35,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151286535] [2022-04-28 08:37:35,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:37:35,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:37:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:35,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:37:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:35,400 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-28 08:37:35,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {21306#true} assume true; {21306#true} is VALID [2022-04-28 08:37:35,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21306#true} {21306#true} #664#return; {21306#true} is VALID [2022-04-28 08:37:35,401 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-28 08:37:35,401 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-28 08:37:35,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {21306#true} assume true; {21306#true} is VALID [2022-04-28 08:37:35,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21306#true} {21306#true} #664#return; {21306#true} is VALID [2022-04-28 08:37:35,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {21306#true} call #t~ret162 := main(); {21306#true} is VALID [2022-04-28 08:37:35,402 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-28 08:37:35,402 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-28 08:37:35,402 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-28 08:37:35,402 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-28 08:37:35,402 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-28 08:37:35,402 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-28 08:37:35,402 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-28 08:37:35,402 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-28 08:37:35,402 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-28 08:37:35,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {21306#true} assume !false; {21306#true} is VALID [2022-04-28 08:37:35,403 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-28 08:37:35,403 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-28 08:37:35,403 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-28 08:37:35,403 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-28 08:37:35,403 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-28 08:37:35,403 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-28 08:37:35,403 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-28 08:37:35,403 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-28 08:37:35,404 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-28 08:37:35,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {21306#true} assume 8464 == #t~mem50;havoc #t~mem50; {21306#true} is VALID [2022-04-28 08:37:35,404 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-28 08:37:35,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {21306#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21306#true} is VALID [2022-04-28 08:37:35,405 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-28 08:37:35,406 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-28 08:37:35,406 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-28 08:37:35,407 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-28 08:37:35,407 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-28 08:37:35,407 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-28 08:37:35,408 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-28 08:37:35,408 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-28 08:37:35,409 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-28 08:37:35,409 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-28 08:37:35,410 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-28 08:37:35,410 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-28 08:37:35,410 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-28 08:37:35,410 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-28 08:37:35,410 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-28 08:37:35,410 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-28 08:37:35,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {21307#false} ~skip~0 := 0; {21307#false} is VALID [2022-04-28 08:37:35,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {21307#false} assume !false; {21307#false} is VALID [2022-04-28 08:37:35,411 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-28 08:37:35,411 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-28 08:37:35,411 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-28 08:37:35,411 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-28 08:37:35,411 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-28 08:37:35,411 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-28 08:37:35,411 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-28 08:37:35,411 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-28 08:37:35,411 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-28 08:37:35,412 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-28 08:37:35,412 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-28 08:37:35,412 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-28 08:37:35,412 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-28 08:37:35,412 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-28 08:37:35,412 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-28 08:37:35,412 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-28 08:37:35,412 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-28 08:37:35,412 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-28 08:37:35,412 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-28 08:37:35,413 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-28 08:37:35,413 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-28 08:37:35,413 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-28 08:37:35,413 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-28 08:37:35,413 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-28 08:37:35,413 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-28 08:37:35,413 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-28 08:37:35,413 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-28 08:37:35,413 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-28 08:37:35,414 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-28 08:37:35,414 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-28 08:37:35,414 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-28 08:37:35,414 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-28 08:37:35,414 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-28 08:37:35,414 INFO L290 TraceCheckUtils]: 78: Hoare triple {21307#false} assume 8672 == #t~mem74;havoc #t~mem74; {21307#false} is VALID [2022-04-28 08:37:35,414 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-28 08:37:35,414 INFO L290 TraceCheckUtils]: 80: Hoare triple {21307#false} assume 4 == ~blastFlag~0; {21307#false} is VALID [2022-04-28 08:37:35,414 INFO L290 TraceCheckUtils]: 81: Hoare triple {21307#false} assume !false; {21307#false} is VALID [2022-04-28 08:37:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:37:35,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:37:35,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151286535] [2022-04-28 08:37:35,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151286535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:35,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:35,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:35,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:37:35,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1949399205] [2022-04-28 08:37:35,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1949399205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:35,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:35,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:35,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48474612] [2022-04-28 08:37:35,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:37:35,416 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-28 08:37:35,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:37:35,417 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-28 08:37:35,492 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-28 08:37:35,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:37:35,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:35,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:37:35,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:37:35,493 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-28 08:37:37,518 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-28 08:37:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:39,048 INFO L93 Difference]: Finished difference Result 879 states and 1336 transitions. [2022-04-28 08:37:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:37:39,048 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-28 08:37:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:37:39,048 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-28 08:37:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-28 08:37:39,052 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-28 08:37:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-28 08:37:39,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 573 transitions. [2022-04-28 08:37:39,445 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-28 08:37:39,458 INFO L225 Difference]: With dead ends: 879 [2022-04-28 08:37:39,459 INFO L226 Difference]: Without dead ends: 570 [2022-04-28 08:37:39,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:37:39,460 INFO L413 NwaCegarLoop]: 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-28 08:37:39,460 INFO L414 NwaCegarLoop]: 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-28 08:37:39,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-04-28 08:37:39,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 369. [2022-04-28 08:37:39,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:37:39,481 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-28 08:37:39,482 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-28 08:37:39,482 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-28 08:37:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:39,498 INFO L93 Difference]: Finished difference Result 570 states and 860 transitions. [2022-04-28 08:37:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 860 transitions. [2022-04-28 08:37:39,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:39,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:39,500 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-28 08:37:39,500 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-28 08:37:39,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:39,516 INFO L93 Difference]: Finished difference Result 570 states and 860 transitions. [2022-04-28 08:37:39,516 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 860 transitions. [2022-04-28 08:37:39,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:39,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:39,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:37:39,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:37:39,518 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-28 08:37:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 559 transitions. [2022-04-28 08:37:39,527 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 559 transitions. Word has length 82 [2022-04-28 08:37:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:37:39,527 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 559 transitions. [2022-04-28 08:37:39,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:39,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 369 states and 559 transitions. [2022-04-28 08:37:39,997 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-28 08:37:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 559 transitions. [2022-04-28 08:37:39,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 08:37:39,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:37:39,998 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:37:39,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:37:39,999 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:37:39,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:37:39,999 INFO L85 PathProgramCache]: Analyzing trace with hash -301741538, now seen corresponding path program 1 times [2022-04-28 08:37:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:39,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [12267337] [2022-04-28 08:37:40,042 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:37:40,042 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:37:40,042 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:37:40,042 INFO L85 PathProgramCache]: Analyzing trace with hash -301741538, now seen corresponding path program 2 times [2022-04-28 08:37:40,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:37:40,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181927440] [2022-04-28 08:37:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:37:40,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:37:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:40,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:37:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:40,184 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-28 08:37:40,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {24954#true} assume true; {24954#true} is VALID [2022-04-28 08:37:40,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24954#true} {24954#true} #664#return; {24954#true} is VALID [2022-04-28 08:37:40,185 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-28 08:37:40,186 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-28 08:37:40,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {24954#true} assume true; {24954#true} is VALID [2022-04-28 08:37:40,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24954#true} {24954#true} #664#return; {24954#true} is VALID [2022-04-28 08:37:40,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {24954#true} call #t~ret162 := main(); {24954#true} is VALID [2022-04-28 08:37:40,186 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-28 08:37:40,186 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-28 08:37:40,186 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-28 08:37:40,186 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-28 08:37:40,186 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-28 08:37:40,186 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-28 08:37:40,187 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-28 08:37:40,187 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-28 08:37:40,187 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-28 08:37:40,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {24954#true} assume !false; {24954#true} is VALID [2022-04-28 08:37:40,187 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-28 08:37:40,187 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-28 08:37:40,187 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-28 08:37:40,187 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-28 08:37:40,187 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-28 08:37:40,187 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-28 08:37:40,188 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-28 08:37:40,188 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-28 08:37:40,188 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-28 08:37:40,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {24954#true} assume 8464 == #t~mem50;havoc #t~mem50; {24954#true} is VALID [2022-04-28 08:37:40,188 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-28 08:37:40,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {24954#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24954#true} is VALID [2022-04-28 08:37:40,189 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-28 08:37:40,190 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-28 08:37:40,190 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-28 08:37:40,191 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-28 08:37:40,191 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-28 08:37:40,192 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-28 08:37:40,192 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-28 08:37:40,192 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-28 08:37:40,193 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-28 08:37:40,193 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-28 08:37:40,194 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-28 08:37:40,194 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-28 08:37:40,195 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-28 08:37:40,195 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-28 08:37:40,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {24955#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {24955#false} is VALID [2022-04-28 08:37:40,195 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-28 08:37:40,195 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-28 08:37:40,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {24955#false} ~skip~0 := 0; {24955#false} is VALID [2022-04-28 08:37:40,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {24955#false} assume !false; {24955#false} is VALID [2022-04-28 08:37:40,196 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-28 08:37:40,196 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-28 08:37:40,196 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-28 08:37:40,196 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-28 08:37:40,196 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-28 08:37:40,196 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-28 08:37:40,196 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-28 08:37:40,196 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-28 08:37:40,196 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-28 08:37:40,196 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-28 08:37:40,197 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-28 08:37:40,197 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-28 08:37:40,197 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-28 08:37:40,197 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-28 08:37:40,197 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-28 08:37:40,197 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-28 08:37:40,197 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-28 08:37:40,197 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-28 08:37:40,197 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-28 08:37:40,198 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-28 08:37:40,198 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-28 08:37:40,198 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-28 08:37:40,198 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-28 08:37:40,198 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-28 08:37:40,198 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-28 08:37:40,198 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-28 08:37:40,198 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-28 08:37:40,198 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-28 08:37:40,198 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-28 08:37:40,199 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-28 08:37:40,199 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-28 08:37:40,199 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-28 08:37:40,199 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-28 08:37:40,199 INFO L290 TraceCheckUtils]: 79: Hoare triple {24955#false} assume 8672 == #t~mem74;havoc #t~mem74; {24955#false} is VALID [2022-04-28 08:37:40,199 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-28 08:37:40,199 INFO L290 TraceCheckUtils]: 81: Hoare triple {24955#false} assume 4 == ~blastFlag~0; {24955#false} is VALID [2022-04-28 08:37:40,199 INFO L290 TraceCheckUtils]: 82: Hoare triple {24955#false} assume !false; {24955#false} is VALID [2022-04-28 08:37:40,200 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-28 08:37:40,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:37:40,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181927440] [2022-04-28 08:37:40,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181927440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:40,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:40,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:40,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:37:40,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [12267337] [2022-04-28 08:37:40,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [12267337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:40,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:40,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:40,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863462074] [2022-04-28 08:37:40,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:37:40,203 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-28 08:37:40,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:37:40,204 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-28 08:37:40,277 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-28 08:37:40,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:37:40,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:40,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:37:40,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:37:40,278 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-28 08:37:42,308 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-28 08:37:43,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:43,583 INFO L93 Difference]: Finished difference Result 911 states and 1384 transitions. [2022-04-28 08:37:43,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:37:43,584 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-28 08:37:43,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:37:43,584 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-28 08:37:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-28 08:37:43,586 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-28 08:37:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-28 08:37:43,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-28 08:37:43,983 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-28 08:37:44,003 INFO L225 Difference]: With dead ends: 911 [2022-04-28 08:37:44,004 INFO L226 Difference]: Without dead ends: 570 [2022-04-28 08:37:44,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:37:44,005 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 138 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:37:44,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 323 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 08:37:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-04-28 08:37:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 371. [2022-04-28 08:37:44,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:37:44,028 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-28 08:37:44,029 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-28 08:37:44,029 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-28 08:37:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:44,045 INFO L93 Difference]: Finished difference Result 570 states and 857 transitions. [2022-04-28 08:37:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 857 transitions. [2022-04-28 08:37:44,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:44,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:44,047 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-28 08:37:44,047 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-28 08:37:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:44,063 INFO L93 Difference]: Finished difference Result 570 states and 857 transitions. [2022-04-28 08:37:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 857 transitions. [2022-04-28 08:37:44,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:44,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:44,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:37:44,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:37:44,065 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-28 08:37:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 560 transitions. [2022-04-28 08:37:44,074 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 560 transitions. Word has length 83 [2022-04-28 08:37:44,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:37:44,074 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 560 transitions. [2022-04-28 08:37:44,075 INFO L496 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-28 08:37:44,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 371 states and 560 transitions. [2022-04-28 08:37:44,561 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-28 08:37:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 560 transitions. [2022-04-28 08:37:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 08:37:44,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:37:44,562 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:37:44,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:37:44,562 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:37:44,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:37:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash -276632906, now seen corresponding path program 1 times [2022-04-28 08:37:44,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:44,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [620162404] [2022-04-28 08:37:44,609 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:37:44,609 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:37:44,609 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:37:44,609 INFO L85 PathProgramCache]: Analyzing trace with hash -276632906, now seen corresponding path program 2 times [2022-04-28 08:37:44,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:37:44,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803518707] [2022-04-28 08:37:44,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:37:44,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:37:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:44,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:37:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:44,742 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-28 08:37:44,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {28670#true} assume true; {28670#true} is VALID [2022-04-28 08:37:44,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28670#true} {28670#true} #664#return; {28670#true} is VALID [2022-04-28 08:37:44,743 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-28 08:37:44,743 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-28 08:37:44,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {28670#true} assume true; {28670#true} is VALID [2022-04-28 08:37:44,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28670#true} {28670#true} #664#return; {28670#true} is VALID [2022-04-28 08:37:44,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {28670#true} call #t~ret162 := main(); {28670#true} is VALID [2022-04-28 08:37:44,744 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-28 08:37:44,744 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-28 08:37:44,744 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-28 08:37:44,744 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-28 08:37:44,744 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-28 08:37:44,744 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-28 08:37:44,744 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-28 08:37:44,745 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-28 08:37:44,745 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-28 08:37:44,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {28670#true} assume !false; {28670#true} is VALID [2022-04-28 08:37:44,745 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-28 08:37:44,745 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-28 08:37:44,745 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-28 08:37:44,745 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-28 08:37:44,745 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-28 08:37:44,745 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-28 08:37:44,745 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-28 08:37:44,746 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-28 08:37:44,746 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-28 08:37:44,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {28670#true} assume 8464 == #t~mem50;havoc #t~mem50; {28670#true} is VALID [2022-04-28 08:37:44,746 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-28 08:37:44,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {28670#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28670#true} is VALID [2022-04-28 08:37:44,746 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-28 08:37:44,746 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-28 08:37:44,746 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-28 08:37:44,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {28670#true} ~skip~0 := 0; {28670#true} is VALID [2022-04-28 08:37:44,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {28670#true} assume !false; {28670#true} is VALID [2022-04-28 08:37:44,747 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-28 08:37:44,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {28670#true} assume 12292 == #t~mem42;havoc #t~mem42; {28670#true} is VALID [2022-04-28 08:37:44,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {28670#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {28670#true} is VALID [2022-04-28 08:37:44,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {28670#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {28670#true} is VALID [2022-04-28 08:37:44,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {28670#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {28670#true} is VALID [2022-04-28 08:37:44,747 INFO L290 TraceCheckUtils]: 37: Hoare triple {28670#true} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {28670#true} is VALID [2022-04-28 08:37:44,747 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-28 08:37:44,747 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-28 08:37:44,747 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-28 08:37:44,748 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-28 08:37:44,749 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-28 08:37:44,749 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-28 08:37:44,750 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-28 08:37:44,750 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-28 08:37:44,750 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-28 08:37:44,751 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-28 08:37:44,751 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-28 08:37:44,752 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-28 08:37:44,752 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-28 08:37:44,753 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-28 08:37:44,753 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-28 08:37:44,753 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-28 08:37:44,753 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-28 08:37:44,753 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-28 08:37:44,754 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-28 08:37:44,754 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-28 08:37:44,754 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-28 08:37:44,754 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-28 08:37:44,754 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-28 08:37:44,754 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-28 08:37:44,754 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-28 08:37:44,754 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-28 08:37:44,754 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-28 08:37:44,755 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-28 08:37:44,755 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-28 08:37:44,755 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-28 08:37:44,755 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-28 08:37:44,755 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-28 08:37:44,755 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-28 08:37:44,755 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-28 08:37:44,755 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-28 08:37:44,755 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-28 08:37:44,755 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-28 08:37:44,756 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-28 08:37:44,756 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-28 08:37:44,756 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-28 08:37:44,756 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-28 08:37:44,756 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-28 08:37:44,756 INFO L290 TraceCheckUtils]: 80: Hoare triple {28671#false} assume 8672 == #t~mem74;havoc #t~mem74; {28671#false} is VALID [2022-04-28 08:37:44,756 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-28 08:37:44,756 INFO L290 TraceCheckUtils]: 82: Hoare triple {28671#false} assume 4 == ~blastFlag~0; {28671#false} is VALID [2022-04-28 08:37:44,756 INFO L290 TraceCheckUtils]: 83: Hoare triple {28671#false} assume !false; {28671#false} is VALID [2022-04-28 08:37:44,757 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-28 08:37:44,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:37:44,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803518707] [2022-04-28 08:37:44,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803518707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:44,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:44,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:44,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:37:44,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [620162404] [2022-04-28 08:37:44,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [620162404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:44,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:44,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:44,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920167876] [2022-04-28 08:37:44,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:37:44,758 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-28 08:37:44,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:37:44,759 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-28 08:37:44,818 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-28 08:37:44,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:37:44,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:44,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:37:44,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:37:44,819 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-28 08:37:46,839 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-28 08:37:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:47,915 INFO L93 Difference]: Finished difference Result 748 states and 1127 transitions. [2022-04-28 08:37:47,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:37:47,915 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-28 08:37:47,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:37:47,916 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-28 08:37:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-28 08:37:47,918 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-28 08:37:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-28 08:37:47,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-28 08:37:48,217 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-28 08:37:48,224 INFO L225 Difference]: With dead ends: 748 [2022-04-28 08:37:48,225 INFO L226 Difference]: Without dead ends: 405 [2022-04-28 08:37:48,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:37:48,226 INFO L413 NwaCegarLoop]: 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-28 08:37:48,226 INFO L414 NwaCegarLoop]: 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-28 08:37:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-28 08:37:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 371. [2022-04-28 08:37:48,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:37:48,248 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-28 08:37:48,249 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-28 08:37:48,249 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-28 08:37:48,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:48,261 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-04-28 08:37:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 600 transitions. [2022-04-28 08:37:48,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:48,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:48,263 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-28 08:37:48,263 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-28 08:37:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:48,272 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-04-28 08:37:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 600 transitions. [2022-04-28 08:37:48,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:48,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:48,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:37:48,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:37:48,274 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-28 08:37:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 558 transitions. [2022-04-28 08:37:48,282 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 558 transitions. Word has length 84 [2022-04-28 08:37:48,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:37:48,283 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 558 transitions. [2022-04-28 08:37:48,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:48,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 371 states and 558 transitions. [2022-04-28 08:37:48,926 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-28 08:37:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 558 transitions. [2022-04-28 08:37:48,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 08:37:48,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:37:48,927 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:37:48,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:37:48,927 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:37:48,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:37:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1096918579, now seen corresponding path program 1 times [2022-04-28 08:37:48,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:48,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1554482686] [2022-04-28 08:37:49,109 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-28 08:37:49,110 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:37:49,110 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:37:49,110 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:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 08:37:49,114 INFO L158 Benchmark]: Toolchain (without parser) took 103233.22ms. Allocated memory was 179.3MB in the beginning and 288.4MB in the end (delta: 109.1MB). Free memory was 120.8MB in the beginning and 219.8MB in the end (delta: -99.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-28 08:37:49,114 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:37:49,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.42ms. Allocated memory was 179.3MB in the beginning and 240.1MB in the end (delta: 60.8MB). Free memory was 120.7MB in the beginning and 186.0MB in the end (delta: -65.3MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-28 08:37:49,115 INFO L158 Benchmark]: Boogie Preprocessor took 141.63ms. Allocated memory is still 240.1MB. Free memory was 186.0MB in the beginning and 176.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 08:37:49,115 INFO L158 Benchmark]: RCFGBuilder took 3317.51ms. Allocated memory is still 240.1MB. Free memory was 176.0MB in the beginning and 167.3MB in the end (delta: 8.7MB). Peak memory consumption was 63.8MB. Max. memory is 8.0GB. [2022-04-28 08:37:49,115 INFO L158 Benchmark]: TraceAbstraction took 99144.67ms. Allocated memory was 240.1MB in the beginning and 288.4MB in the end (delta: 48.2MB). Free memory was 166.8MB in the beginning and 219.8MB in the end (delta: -53.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:37:49,116 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 623.42ms. Allocated memory was 179.3MB in the beginning and 240.1MB in the end (delta: 60.8MB). Free memory was 120.7MB in the beginning and 186.0MB in the end (delta: -65.3MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 141.63ms. Allocated memory is still 240.1MB. Free memory was 186.0MB in the beginning and 176.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 3317.51ms. Allocated memory is still 240.1MB. Free memory was 176.0MB in the beginning and 167.3MB in the end (delta: 8.7MB). Peak memory consumption was 63.8MB. Max. memory is 8.0GB. * TraceAbstraction took 99144.67ms. Allocated memory was 240.1MB in the beginning and 288.4MB in the end (delta: 48.2MB). Free memory was 166.8MB in the beginning and 219.8MB in the end (delta: -53.0MB). There was no memory consumed. 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-28 08:37:49,188 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...