/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.08.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:41:08,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:41:08,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:41:08,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:41:08,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:41:08,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:41:08,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:41:08,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:41:08,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:41:08,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:41:08,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:41:08,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:41:08,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:41:08,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:41:08,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:41:08,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:41:08,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:41:08,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:41:08,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:41:08,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:41:08,796 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:41:08,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:41:08,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:41:08,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:41:08,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:41:08,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:41:08,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:41:08,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:41:08,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:41:08,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:41:08,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:41:08,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:41:08,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:41:08,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:41:08,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:41:08,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:41:08,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:41:08,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:41:08,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:41:08,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:41:08,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:41:08,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:41:08,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:41:08,821 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:41:08,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:41:08,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:41:08,823 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:41:08,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:41:08,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:41:08,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:41:08,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:41:08,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:41:08,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:41:08,824 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:41:08,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:41:08,824 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:41:08,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:41:08,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:41:08,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:41:08,824 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:41:08,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:41:08,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:41:08,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:41:08,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:41:08,825 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:41:08,825 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:41:08,825 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:41:08,825 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:41:08,825 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:41:09,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:41:09,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:41:09,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:41:09,040 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:41:09,041 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:41:09,042 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.08.i.cil-1.c [2022-04-08 08:41:09,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1badff4/85d19304156b4d0d9007996f18e06736/FLAGcc75cbb43 [2022-04-08 08:41:09,545 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:41:09,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.08.i.cil-1.c [2022-04-08 08:41:09,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1badff4/85d19304156b4d0d9007996f18e06736/FLAGcc75cbb43 [2022-04-08 08:41:09,575 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1badff4/85d19304156b4d0d9007996f18e06736 [2022-04-08 08:41:09,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:41:09,578 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:41:09,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:41:09,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:41:09,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:41:09,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:41:09" (1/1) ... [2022-04-08 08:41:09,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4189e706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:09, skipping insertion in model container [2022-04-08 08:41:09,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:41:09" (1/1) ... [2022-04-08 08:41:09,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:41:09,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:41:09,940 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.08.i.cil-1.c[74696,74709] [2022-04-08 08:41:09,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:41:09,959 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:41:10,057 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.08.i.cil-1.c[74696,74709] [2022-04-08 08:41:10,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:41:10,074 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:41:10,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:10 WrapperNode [2022-04-08 08:41:10,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:41:10,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:41:10,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:41:10,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:41:10,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:10" (1/1) ... [2022-04-08 08:41:10,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:10" (1/1) ... [2022-04-08 08:41:10,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:10" (1/1) ... [2022-04-08 08:41:10,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:10" (1/1) ... [2022-04-08 08:41:10,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:10" (1/1) ... [2022-04-08 08:41:10,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:10" (1/1) ... [2022-04-08 08:41:10,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:10" (1/1) ... [2022-04-08 08:41:10,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:41:10,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:41:10,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:41:10,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:41:10,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:10" (1/1) ... [2022-04-08 08:41:10,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:41:10,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:41:10,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:41:10,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:41:10,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:41:10,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:41:10,246 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:41:10,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 08:41:10,246 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 08:41:10,246 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:41:10,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 08:41:10,247 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:41:10,247 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:41:10,247 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:41:10,247 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:41:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:41:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:41:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:41:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:41:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:41:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:41:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:41:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:41:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:41:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 08:41:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:41:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 08:41:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 08:41:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:41:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:41:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:41:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:41:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:41:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:41:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:41:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:41:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:41:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:41:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:41:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:41:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:41:10,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:41:10,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:41:10,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:41:10,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:41:10,408 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:41:10,409 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:41:11,102 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:41:11,545 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 08:41:11,545 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 08:41:11,554 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:41:11,566 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:41:11,566 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:41:11,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:41:11 BoogieIcfgContainer [2022-04-08 08:41:11,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:41:11,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:41:11,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:41:11,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:41:11,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:41:09" (1/3) ... [2022-04-08 08:41:11,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600e0dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:41:11, skipping insertion in model container [2022-04-08 08:41:11,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:10" (2/3) ... [2022-04-08 08:41:11,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600e0dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:41:11, skipping insertion in model container [2022-04-08 08:41:11,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:41:11" (3/3) ... [2022-04-08 08:41:11,577 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-1.c [2022-04-08 08:41:11,581 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:41:11,581 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:41:11,614 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:41:11,621 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:41:11,621 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:41:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 151 states have (on average 1.7086092715231789) internal successors, (258), 152 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 08:41:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 08:41:11,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:11,650 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:11,651 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:11,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:11,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1930935805, now seen corresponding path program 1 times [2022-04-08 08:41:11,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:11,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [695939964] [2022-04-08 08:41:11,667 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:41:11,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1930935805, now seen corresponding path program 2 times [2022-04-08 08:41:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:11,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858168222] [2022-04-08 08:41:11,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:11,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:12,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:12,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {162#true} is VALID [2022-04-08 08:41:12,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} assume true; {162#true} is VALID [2022-04-08 08:41:12,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {162#true} {162#true} #693#return; {162#true} is VALID [2022-04-08 08:41:12,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {162#true} call ULTIMATE.init(); {169#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:12,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {162#true} is VALID [2022-04-08 08:41:12,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} assume true; {162#true} is VALID [2022-04-08 08:41:12,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162#true} {162#true} #693#return; {162#true} is VALID [2022-04-08 08:41:12,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {162#true} call #t~ret161 := main(); {162#true} is VALID [2022-04-08 08:41:12,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {162#true} is VALID [2022-04-08 08:41:12,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {162#true} is VALID [2022-04-08 08:41:12,113 INFO L272 TraceCheckUtils]: 7: Hoare triple {162#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {162#true} is VALID [2022-04-08 08:41:12,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#(= 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)))); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:12,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {168#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-08 08:41:12,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {168#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {163#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {163#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {163#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {163#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {163#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {163#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {163#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {163#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {163#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {163#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {163#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {163#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {163#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {163#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {163#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {163#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {163#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {163#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {163#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-08 08:41:12,136 INFO L290 TraceCheckUtils]: 44: Hoare triple {163#false} assume 8640 == #t~mem75;havoc #t~mem75; {163#false} is VALID [2022-04-08 08:41:12,136 INFO L290 TraceCheckUtils]: 45: Hoare triple {163#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {163#false} is VALID [2022-04-08 08:41:12,136 INFO L290 TraceCheckUtils]: 46: Hoare triple {163#false} assume !(4 == ~blastFlag~0); {163#false} is VALID [2022-04-08 08:41:12,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {163#false} assume !(7 == ~blastFlag~0); {163#false} is VALID [2022-04-08 08:41:12,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {163#false} assume 10 == ~blastFlag~0; {163#false} is VALID [2022-04-08 08:41:12,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {163#false} assume !false; {163#false} is VALID [2022-04-08 08:41:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:41:12,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:12,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858168222] [2022-04-08 08:41:12,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858168222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:12,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:12,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:12,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:12,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [695939964] [2022-04-08 08:41:12,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [695939964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:12,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:12,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455596342] [2022-04-08 08:41:12,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:12,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 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 50 [2022-04-08 08:41:12,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:12,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:12,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:12,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:12,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:12,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:12,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:12,224 INFO L87 Difference]: Start difference. First operand has 159 states, 151 states have (on average 1.7086092715231789) internal successors, (258), 152 states have internal predecessors, (258), 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.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:16,084 INFO L93 Difference]: Finished difference Result 336 states and 564 transitions. [2022-04-08 08:41:16,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:16,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 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 50 [2022-04-08 08:41:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-08 08:41:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-08 08:41:16,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 564 transitions. [2022-04-08 08:41:16,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:16,526 INFO L225 Difference]: With dead ends: 336 [2022-04-08 08:41:16,526 INFO L226 Difference]: Without dead ends: 171 [2022-04-08 08:41:16,529 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:41:16,534 INFO L913 BasicCegarLoop]: 231 mSDtfsCounter, 34 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:16,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 613 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 08:41:16,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-04-08 08:41:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2022-04-08 08:41:16,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:16,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:16,580 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:16,581 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:16,589 INFO L93 Difference]: Finished difference Result 171 states and 257 transitions. [2022-04-08 08:41:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2022-04-08 08:41:16,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:16,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:16,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 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 171 states. [2022-04-08 08:41:16,597 INFO L87 Difference]: Start difference. First operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 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 171 states. [2022-04-08 08:41:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:16,607 INFO L93 Difference]: Finished difference Result 171 states and 257 transitions. [2022-04-08 08:41:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2022-04-08 08:41:16,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:16,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:16,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:16,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 236 transitions. [2022-04-08 08:41:16,614 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 236 transitions. Word has length 50 [2022-04-08 08:41:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:16,614 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 236 transitions. [2022-04-08 08:41:16,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:16,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 154 states and 236 transitions. [2022-04-08 08:41:16,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 236 transitions. [2022-04-08 08:41:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 08:41:16,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:16,769 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:16,769 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:41:16,770 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:16,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:16,770 INFO L85 PathProgramCache]: Analyzing trace with hash -213156207, now seen corresponding path program 1 times [2022-04-08 08:41:16,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:16,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1384346576] [2022-04-08 08:41:16,795 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:16,795 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:16,795 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:16,796 INFO L85 PathProgramCache]: Analyzing trace with hash -213156207, now seen corresponding path program 2 times [2022-04-08 08:41:16,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:16,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281054533] [2022-04-08 08:41:16,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:16,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:16,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:17,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {1503#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {1496#true} is VALID [2022-04-08 08:41:17,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {1496#true} assume true; {1496#true} is VALID [2022-04-08 08:41:17,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1496#true} {1496#true} #693#return; {1496#true} is VALID [2022-04-08 08:41:17,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {1496#true} call ULTIMATE.init(); {1503#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:17,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {1496#true} is VALID [2022-04-08 08:41:17,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {1496#true} assume true; {1496#true} is VALID [2022-04-08 08:41:17,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1496#true} {1496#true} #693#return; {1496#true} is VALID [2022-04-08 08:41:17,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {1496#true} call #t~ret161 := main(); {1496#true} is VALID [2022-04-08 08:41:17,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {1496#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1496#true} is VALID [2022-04-08 08:41:17,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {1496#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1496#true} is VALID [2022-04-08 08:41:17,010 INFO L272 TraceCheckUtils]: 7: Hoare triple {1496#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1496#true} is VALID [2022-04-08 08:41:17,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {1496#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:17,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:17,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:17,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {1501#(= 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)))); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:17,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:17,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:17,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:17,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:17,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:17,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:17,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:17,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:17,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1502#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-08 08:41:17,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {1502#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {1497#false} is VALID [2022-04-08 08:41:17,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {1497#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {1497#false} is VALID [2022-04-08 08:41:17,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {1497#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {1497#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {1497#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1497#false} is VALID [2022-04-08 08:41:17,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {1497#false} ~skip~0 := 0; {1497#false} is VALID [2022-04-08 08:41:17,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {1497#false} assume !false; {1497#false} is VALID [2022-04-08 08:41:17,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {1497#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {1497#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,019 INFO L290 TraceCheckUtils]: 30: Hoare triple {1497#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {1497#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {1497#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {1497#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,020 INFO L290 TraceCheckUtils]: 34: Hoare triple {1497#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,020 INFO L290 TraceCheckUtils]: 35: Hoare triple {1497#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,020 INFO L290 TraceCheckUtils]: 36: Hoare triple {1497#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,020 INFO L290 TraceCheckUtils]: 37: Hoare triple {1497#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,021 INFO L290 TraceCheckUtils]: 38: Hoare triple {1497#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {1497#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {1497#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,023 INFO L290 TraceCheckUtils]: 41: Hoare triple {1497#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {1497#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,025 INFO L290 TraceCheckUtils]: 43: Hoare triple {1497#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,025 INFO L290 TraceCheckUtils]: 44: Hoare triple {1497#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {1497#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,026 INFO L290 TraceCheckUtils]: 46: Hoare triple {1497#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,026 INFO L290 TraceCheckUtils]: 47: Hoare triple {1497#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {1497#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {1497#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {1497#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {1497#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,028 INFO L290 TraceCheckUtils]: 52: Hoare triple {1497#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,028 INFO L290 TraceCheckUtils]: 53: Hoare triple {1497#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,028 INFO L290 TraceCheckUtils]: 54: Hoare triple {1497#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,029 INFO L290 TraceCheckUtils]: 55: Hoare triple {1497#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,029 INFO L290 TraceCheckUtils]: 56: Hoare triple {1497#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-08 08:41:17,029 INFO L290 TraceCheckUtils]: 57: Hoare triple {1497#false} assume 8640 == #t~mem75;havoc #t~mem75; {1497#false} is VALID [2022-04-08 08:41:17,030 INFO L290 TraceCheckUtils]: 58: Hoare triple {1497#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1497#false} is VALID [2022-04-08 08:41:17,030 INFO L290 TraceCheckUtils]: 59: Hoare triple {1497#false} assume !(4 == ~blastFlag~0); {1497#false} is VALID [2022-04-08 08:41:17,030 INFO L290 TraceCheckUtils]: 60: Hoare triple {1497#false} assume !(7 == ~blastFlag~0); {1497#false} is VALID [2022-04-08 08:41:17,031 INFO L290 TraceCheckUtils]: 61: Hoare triple {1497#false} assume 10 == ~blastFlag~0; {1497#false} is VALID [2022-04-08 08:41:17,031 INFO L290 TraceCheckUtils]: 62: Hoare triple {1497#false} assume !false; {1497#false} is VALID [2022-04-08 08:41:17,032 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-08 08:41:17,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:17,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281054533] [2022-04-08 08:41:17,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281054533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:17,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:17,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:17,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:17,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1384346576] [2022-04-08 08:41:17,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1384346576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:17,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:17,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:17,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871933770] [2022-04-08 08:41:17,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:17,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 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 63 [2022-04-08 08:41:17,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:17,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:17,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:17,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:17,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:17,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:17,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:17,075 INFO L87 Difference]: Start difference. First operand 154 states and 236 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:23,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:23,635 INFO L93 Difference]: Finished difference Result 299 states and 455 transitions. [2022-04-08 08:41:23,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:23,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 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 63 [2022-04-08 08:41:23,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:23,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-08 08:41:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-08 08:41:23,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 455 transitions. [2022-04-08 08:41:23,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:23,959 INFO L225 Difference]: With dead ends: 299 [2022-04-08 08:41:23,959 INFO L226 Difference]: Without dead ends: 171 [2022-04-08 08:41:23,960 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:41:23,961 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 24 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:23,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 489 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 08:41:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-04-08 08:41:23,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2022-04-08 08:41:23,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:23,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 149 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:23,969 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 149 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:23,969 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 149 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:23,973 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2022-04-08 08:41:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2022-04-08 08:41:23,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:23,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:23,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 149 states have internal predecessors, (231), 3 states have call successors, (3), 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 171 states. [2022-04-08 08:41:23,974 INFO L87 Difference]: Start difference. First operand has 154 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 149 states have internal predecessors, (231), 3 states have call successors, (3), 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 171 states. [2022-04-08 08:41:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:23,978 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2022-04-08 08:41:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2022-04-08 08:41:23,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:23,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:23,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:23,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 149 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 235 transitions. [2022-04-08 08:41:23,984 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 235 transitions. Word has length 63 [2022-04-08 08:41:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:23,985 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 235 transitions. [2022-04-08 08:41:23,986 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:23,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 154 states and 235 transitions. [2022-04-08 08:41:24,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 235 transitions. [2022-04-08 08:41:24,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:41:24,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:24,133 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:24,133 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:41:24,133 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:24,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:24,134 INFO L85 PathProgramCache]: Analyzing trace with hash 369840513, now seen corresponding path program 1 times [2022-04-08 08:41:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:24,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [615243771] [2022-04-08 08:41:24,164 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:24,164 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:24,164 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash 369840513, now seen corresponding path program 2 times [2022-04-08 08:41:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:24,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672027163] [2022-04-08 08:41:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:24,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:24,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {2763#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {2756#true} is VALID [2022-04-08 08:41:24,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {2756#true} assume true; {2756#true} is VALID [2022-04-08 08:41:24,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2756#true} {2756#true} #693#return; {2756#true} is VALID [2022-04-08 08:41:24,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {2756#true} call ULTIMATE.init(); {2763#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:24,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {2763#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {2756#true} is VALID [2022-04-08 08:41:24,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {2756#true} assume true; {2756#true} is VALID [2022-04-08 08:41:24,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2756#true} {2756#true} #693#return; {2756#true} is VALID [2022-04-08 08:41:24,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {2756#true} call #t~ret161 := main(); {2756#true} is VALID [2022-04-08 08:41:24,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {2756#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {2756#true} is VALID [2022-04-08 08:41:24,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {2756#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2756#true} is VALID [2022-04-08 08:41:24,334 INFO L272 TraceCheckUtils]: 7: Hoare triple {2756#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2756#true} is VALID [2022-04-08 08:41:24,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {2756#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:24,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:24,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:24,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {2761#(not (= 12292 (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)))); {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:24,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:24,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:24,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:24,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2762#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-08 08:41:24,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {2762#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {2757#false} is VALID [2022-04-08 08:41:24,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {2757#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {2757#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {2757#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2757#false} is VALID [2022-04-08 08:41:24,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {2757#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {2757#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {2757#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {2757#false} is VALID [2022-04-08 08:41:24,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {2757#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {2757#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {2757#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {2757#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {2757#false} is VALID [2022-04-08 08:41:24,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {2757#false} ~skip~0 := 0; {2757#false} is VALID [2022-04-08 08:41:24,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {2757#false} assume !false; {2757#false} is VALID [2022-04-08 08:41:24,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {2757#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {2757#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {2757#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {2757#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {2757#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {2757#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {2757#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {2757#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {2757#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {2757#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {2757#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {2757#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,343 INFO L290 TraceCheckUtils]: 41: Hoare triple {2757#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,343 INFO L290 TraceCheckUtils]: 42: Hoare triple {2757#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,343 INFO L290 TraceCheckUtils]: 43: Hoare triple {2757#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,343 INFO L290 TraceCheckUtils]: 44: Hoare triple {2757#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,343 INFO L290 TraceCheckUtils]: 45: Hoare triple {2757#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,343 INFO L290 TraceCheckUtils]: 46: Hoare triple {2757#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,343 INFO L290 TraceCheckUtils]: 47: Hoare triple {2757#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,343 INFO L290 TraceCheckUtils]: 48: Hoare triple {2757#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,344 INFO L290 TraceCheckUtils]: 49: Hoare triple {2757#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,344 INFO L290 TraceCheckUtils]: 50: Hoare triple {2757#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {2757#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {2757#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,345 INFO L290 TraceCheckUtils]: 53: Hoare triple {2757#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,345 INFO L290 TraceCheckUtils]: 54: Hoare triple {2757#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,345 INFO L290 TraceCheckUtils]: 55: Hoare triple {2757#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,345 INFO L290 TraceCheckUtils]: 56: Hoare triple {2757#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,345 INFO L290 TraceCheckUtils]: 57: Hoare triple {2757#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-08 08:41:24,345 INFO L290 TraceCheckUtils]: 58: Hoare triple {2757#false} assume 8640 == #t~mem75;havoc #t~mem75; {2757#false} is VALID [2022-04-08 08:41:24,345 INFO L290 TraceCheckUtils]: 59: Hoare triple {2757#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {2757#false} is VALID [2022-04-08 08:41:24,345 INFO L290 TraceCheckUtils]: 60: Hoare triple {2757#false} assume !(4 == ~blastFlag~0); {2757#false} is VALID [2022-04-08 08:41:24,345 INFO L290 TraceCheckUtils]: 61: Hoare triple {2757#false} assume !(7 == ~blastFlag~0); {2757#false} is VALID [2022-04-08 08:41:24,346 INFO L290 TraceCheckUtils]: 62: Hoare triple {2757#false} assume 10 == ~blastFlag~0; {2757#false} is VALID [2022-04-08 08:41:24,346 INFO L290 TraceCheckUtils]: 63: Hoare triple {2757#false} assume !false; {2757#false} is VALID [2022-04-08 08:41:24,346 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-08 08:41:24,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:24,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672027163] [2022-04-08 08:41:24,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672027163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:24,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:24,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:24,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:24,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [615243771] [2022-04-08 08:41:24,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [615243771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:24,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:24,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:24,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321058149] [2022-04-08 08:41:24,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:24,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:41:24,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:24,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:24,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:24,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:24,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:24,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:24,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:24,398 INFO L87 Difference]: Start difference. First operand 154 states and 235 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:27,744 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:29,932 INFO L93 Difference]: Finished difference Result 399 states and 616 transitions. [2022-04-08 08:41:29,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:29,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:41:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2022-04-08 08:41:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2022-04-08 08:41:29,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 598 transitions. [2022-04-08 08:41:30,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 598 edges. 598 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:30,323 INFO L225 Difference]: With dead ends: 399 [2022-04-08 08:41:30,324 INFO L226 Difference]: Without dead ends: 271 [2022-04-08 08:41:30,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:41:30,325 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 150 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:30,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 350 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 08:41:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-08 08:41:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 165. [2022-04-08 08:41:30,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:30,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 165 states, 160 states have (on average 1.5375) internal successors, (246), 160 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:30,333 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 165 states, 160 states have (on average 1.5375) internal successors, (246), 160 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:30,333 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 165 states, 160 states have (on average 1.5375) internal successors, (246), 160 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:30,344 INFO L93 Difference]: Finished difference Result 271 states and 416 transitions. [2022-04-08 08:41:30,344 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 416 transitions. [2022-04-08 08:41:30,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:30,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:30,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 160 states have (on average 1.5375) internal successors, (246), 160 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 271 states. [2022-04-08 08:41:30,353 INFO L87 Difference]: Start difference. First operand has 165 states, 160 states have (on average 1.5375) internal successors, (246), 160 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 271 states. [2022-04-08 08:41:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:30,364 INFO L93 Difference]: Finished difference Result 271 states and 416 transitions. [2022-04-08 08:41:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 416 transitions. [2022-04-08 08:41:30,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:30,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:30,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:30,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.5375) internal successors, (246), 160 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2022-04-08 08:41:30,370 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 64 [2022-04-08 08:41:30,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:30,371 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2022-04-08 08:41:30,371 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:30,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 165 states and 250 transitions. [2022-04-08 08:41:30,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2022-04-08 08:41:30,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:41:30,525 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:30,525 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:30,525 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:41:30,525 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:30,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2038223339, now seen corresponding path program 1 times [2022-04-08 08:41:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:30,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [933392997] [2022-04-08 08:41:30,660 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:41:30,660 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:41:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1395713082, now seen corresponding path program 1 times [2022-04-08 08:41:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:30,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89334140] [2022-04-08 08:41:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:30,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:30,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {4444#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {4438#true} is VALID [2022-04-08 08:41:30,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {4438#true} assume true; {4438#true} is VALID [2022-04-08 08:41:30,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4438#true} {4438#true} #693#return; {4438#true} is VALID [2022-04-08 08:41:30,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {4438#true} call ULTIMATE.init(); {4444#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:30,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {4444#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {4438#true} is VALID [2022-04-08 08:41:30,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {4438#true} assume true; {4438#true} is VALID [2022-04-08 08:41:30,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4438#true} {4438#true} #693#return; {4438#true} is VALID [2022-04-08 08:41:30,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {4438#true} call #t~ret161 := main(); {4438#true} is VALID [2022-04-08 08:41:30,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {4438#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {4438#true} is VALID [2022-04-08 08:41:30,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {4438#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4438#true} is VALID [2022-04-08 08:41:30,783 INFO L272 TraceCheckUtils]: 7: Hoare triple {4438#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4438#true} is VALID [2022-04-08 08:41:30,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {4438#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {4443#(= 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)))); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} [699] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_250|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_8|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_8|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_4|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_8|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_8|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_10|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_5|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_15, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_4|, #memory_int=|v_#memory_int_251|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_250|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_7} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} [698] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,794 INFO L290 TraceCheckUtils]: 38: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,797 INFO L290 TraceCheckUtils]: 46: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,797 INFO L290 TraceCheckUtils]: 47: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:30,798 INFO L290 TraceCheckUtils]: 49: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume 10 == ~blastFlag~0; {4439#false} is VALID [2022-04-08 08:41:30,798 INFO L290 TraceCheckUtils]: 50: Hoare triple {4439#false} assume !false; {4439#false} is VALID [2022-04-08 08:41:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:41:30,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:30,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89334140] [2022-04-08 08:41:30,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89334140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:30,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:30,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:41:33,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:33,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [933392997] [2022-04-08 08:41:33,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [933392997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:33,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:33,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 08:41:33,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552091066] [2022-04-08 08:41:33,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:33,655 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:41:33,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:33,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:33,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:33,714 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 08:41:33,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:33,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 08:41:33,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-08 08:41:33,715 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:35,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:37,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:41,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:45,033 INFO L93 Difference]: Finished difference Result 440 states and 677 transitions. [2022-04-08 08:41:45,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 08:41:45,034 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:41:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:45,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 612 transitions. [2022-04-08 08:41:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 612 transitions. [2022-04-08 08:41:45,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 612 transitions. [2022-04-08 08:41:45,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 612 edges. 612 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:45,459 INFO L225 Difference]: With dead ends: 440 [2022-04-08 08:41:45,459 INFO L226 Difference]: Without dead ends: 301 [2022-04-08 08:41:45,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-08 08:41:45,462 INFO L913 BasicCegarLoop]: 342 mSDtfsCounter, 144 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 709 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:45,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 1361 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 809 Invalid, 1 Unknown, 709 Unchecked, 6.7s Time] [2022-04-08 08:41:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-08 08:41:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2022-04-08 08:41:45,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:45,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 297 states, 292 states have (on average 1.5136986301369864) internal successors, (442), 292 states have internal predecessors, (442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:45,488 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 297 states, 292 states have (on average 1.5136986301369864) internal successors, (442), 292 states have internal predecessors, (442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:45,489 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 297 states, 292 states have (on average 1.5136986301369864) internal successors, (442), 292 states have internal predecessors, (442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:45,493 INFO L93 Difference]: Finished difference Result 301 states and 451 transitions. [2022-04-08 08:41:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 451 transitions. [2022-04-08 08:41:45,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:45,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:45,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 292 states have (on average 1.5136986301369864) internal successors, (442), 292 states have internal predecessors, (442), 3 states have call successors, (3), 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 301 states. [2022-04-08 08:41:45,495 INFO L87 Difference]: Start difference. First operand has 297 states, 292 states have (on average 1.5136986301369864) internal successors, (442), 292 states have internal predecessors, (442), 3 states have call successors, (3), 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 301 states. [2022-04-08 08:41:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:45,500 INFO L93 Difference]: Finished difference Result 301 states and 451 transitions. [2022-04-08 08:41:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 451 transitions. [2022-04-08 08:41:45,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:45,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:45,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:45,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 292 states have (on average 1.5136986301369864) internal successors, (442), 292 states have internal predecessors, (442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 446 transitions. [2022-04-08 08:41:45,506 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 446 transitions. Word has length 64 [2022-04-08 08:41:45,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:45,507 INFO L478 AbstractCegarLoop]: Abstraction has 297 states and 446 transitions. [2022-04-08 08:41:45,507 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:45,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 297 states and 446 transitions. [2022-04-08 08:41:45,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 446 transitions. [2022-04-08 08:41:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:41:45,818 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:45,818 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:45,819 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:41:45,819 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:45,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:45,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1144737001, now seen corresponding path program 1 times [2022-04-08 08:41:45,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:45,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [275838908] [2022-04-08 08:41:45,948 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:41:45,948 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:41:45,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1130548346, now seen corresponding path program 1 times [2022-04-08 08:41:45,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:45,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024585253] [2022-04-08 08:41:45,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:45,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:46,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:46,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {6538#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {6532#true} is VALID [2022-04-08 08:41:46,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {6532#true} assume true; {6532#true} is VALID [2022-04-08 08:41:46,042 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6532#true} {6532#true} #693#return; {6532#true} is VALID [2022-04-08 08:41:46,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {6532#true} call ULTIMATE.init(); {6538#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:46,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {6538#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {6532#true} is VALID [2022-04-08 08:41:46,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {6532#true} assume true; {6532#true} is VALID [2022-04-08 08:41:46,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6532#true} {6532#true} #693#return; {6532#true} is VALID [2022-04-08 08:41:46,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {6532#true} call #t~ret161 := main(); {6532#true} is VALID [2022-04-08 08:41:46,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {6532#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {6532#true} is VALID [2022-04-08 08:41:46,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {6532#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6532#true} is VALID [2022-04-08 08:41:46,060 INFO L272 TraceCheckUtils]: 7: Hoare triple {6532#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6532#true} is VALID [2022-04-08 08:41:46,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {6532#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {6537#(= 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)))); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} [701] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_14|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_269|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_14|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_14|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_15|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_13|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_8|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_14|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_14|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_13|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_16|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_9|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_19, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_8|, #memory_int=|v_#memory_int_269|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_8|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_269|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_11} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} [700] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,076 INFO L290 TraceCheckUtils]: 47: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,076 INFO L290 TraceCheckUtils]: 48: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:41:46,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume 10 == ~blastFlag~0; {6533#false} is VALID [2022-04-08 08:41:46,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {6533#false} assume !false; {6533#false} is VALID [2022-04-08 08:41:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:41:46,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:46,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024585253] [2022-04-08 08:41:46,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024585253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:46,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:46,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:41:49,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:49,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [275838908] [2022-04-08 08:41:49,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [275838908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:49,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:49,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 08:41:49,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973075460] [2022-04-08 08:41:49,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:49,802 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:41:49,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:49,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:49,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:49,863 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 08:41:49,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:49,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 08:41:49,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-08 08:41:49,864 INFO L87 Difference]: Start difference. First operand 297 states and 446 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:52,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:54,022 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:58,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:58,235 INFO L93 Difference]: Finished difference Result 579 states and 882 transitions. [2022-04-08 08:41:58,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 08:41:58,236 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:41:58,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 621 transitions. [2022-04-08 08:41:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:58,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 621 transitions. [2022-04-08 08:41:58,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 621 transitions. [2022-04-08 08:41:58,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 621 edges. 621 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:58,676 INFO L225 Difference]: With dead ends: 579 [2022-04-08 08:41:58,676 INFO L226 Difference]: Without dead ends: 440 [2022-04-08 08:41:58,677 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-08 08:41:58,677 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 154 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:58,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 808 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 486 Invalid, 1 Unknown, 272 Unchecked, 5.2s Time] [2022-04-08 08:41:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-04-08 08:41:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 433. [2022-04-08 08:41:58,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:58,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 440 states. Second operand has 433 states, 428 states have (on average 1.5046728971962617) internal successors, (644), 428 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:58,707 INFO L74 IsIncluded]: Start isIncluded. First operand 440 states. Second operand has 433 states, 428 states have (on average 1.5046728971962617) internal successors, (644), 428 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:58,708 INFO L87 Difference]: Start difference. First operand 440 states. Second operand has 433 states, 428 states have (on average 1.5046728971962617) internal successors, (644), 428 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:58,716 INFO L93 Difference]: Finished difference Result 440 states and 656 transitions. [2022-04-08 08:41:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 656 transitions. [2022-04-08 08:41:58,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:58,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:58,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 433 states, 428 states have (on average 1.5046728971962617) internal successors, (644), 428 states have internal predecessors, (644), 3 states have call successors, (3), 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 440 states. [2022-04-08 08:41:58,718 INFO L87 Difference]: Start difference. First operand has 433 states, 428 states have (on average 1.5046728971962617) internal successors, (644), 428 states have internal predecessors, (644), 3 states have call successors, (3), 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 440 states. [2022-04-08 08:41:58,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:58,726 INFO L93 Difference]: Finished difference Result 440 states and 656 transitions. [2022-04-08 08:41:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 656 transitions. [2022-04-08 08:41:58,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:58,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:58,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:58,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 428 states have (on average 1.5046728971962617) internal successors, (644), 428 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 648 transitions. [2022-04-08 08:41:58,739 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 648 transitions. Word has length 64 [2022-04-08 08:41:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:58,739 INFO L478 AbstractCegarLoop]: Abstraction has 433 states and 648 transitions. [2022-04-08 08:41:58,739 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:58,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 433 states and 648 transitions. [2022-04-08 08:41:59,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 648 edges. 648 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 648 transitions. [2022-04-08 08:41:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 08:41:59,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:59,206 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:59,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:41:59,206 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:59,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:59,206 INFO L85 PathProgramCache]: Analyzing trace with hash 415908008, now seen corresponding path program 1 times [2022-04-08 08:41:59,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:59,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1454047534] [2022-04-08 08:41:59,222 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:59,222 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:59,222 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:59,223 INFO L85 PathProgramCache]: Analyzing trace with hash 415908008, now seen corresponding path program 2 times [2022-04-08 08:41:59,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:59,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179695630] [2022-04-08 08:41:59,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:59,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:59,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:59,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {9461#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {9454#true} is VALID [2022-04-08 08:41:59,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {9454#true} assume true; {9454#true} is VALID [2022-04-08 08:41:59,375 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9454#true} {9454#true} #693#return; {9454#true} is VALID [2022-04-08 08:41:59,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {9454#true} call ULTIMATE.init(); {9461#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:59,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {9461#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {9454#true} is VALID [2022-04-08 08:41:59,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {9454#true} assume true; {9454#true} is VALID [2022-04-08 08:41:59,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9454#true} {9454#true} #693#return; {9454#true} is VALID [2022-04-08 08:41:59,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {9454#true} call #t~ret161 := main(); {9454#true} is VALID [2022-04-08 08:41:59,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {9454#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9454#true} is VALID [2022-04-08 08:41:59,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {9454#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9454#true} is VALID [2022-04-08 08:41:59,377 INFO L272 TraceCheckUtils]: 7: Hoare triple {9454#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9454#true} is VALID [2022-04-08 08:41:59,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {9454#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9454#true} is VALID [2022-04-08 08:41:59,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {9454#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9454#true} is VALID [2022-04-08 08:41:59,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {9454#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {9454#true} is VALID [2022-04-08 08:41:59,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {9454#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9454#true} is VALID [2022-04-08 08:41:59,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {9454#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9454#true} is VALID [2022-04-08 08:41:59,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {9454#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {9454#true} is VALID [2022-04-08 08:41:59,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {9454#true} assume !false; {9454#true} is VALID [2022-04-08 08:41:59,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {9454#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-08 08:41:59,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {9454#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-08 08:41:59,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {9454#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-08 08:41:59,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {9454#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-08 08:41:59,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {9454#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-08 08:41:59,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {9454#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-08 08:41:59,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {9454#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-08 08:41:59,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {9454#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-08 08:41:59,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {9454#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-08 08:41:59,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {9454#true} assume 8464 == #t~mem55;havoc #t~mem55; {9454#true} is VALID [2022-04-08 08:41:59,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {9454#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {9454#true} is VALID [2022-04-08 08:41:59,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {9454#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9454#true} is VALID [2022-04-08 08:41:59,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {9454#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); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,383 INFO L290 TraceCheckUtils]: 37: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,383 INFO L290 TraceCheckUtils]: 38: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,384 INFO L290 TraceCheckUtils]: 39: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:59,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9460#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-08 08:41:59,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {9460#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {9455#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {9455#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {9455#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {9455#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {9455#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {9455#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,390 INFO L290 TraceCheckUtils]: 51: Hoare triple {9455#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {9455#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {9455#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {9455#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {9455#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {9455#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {9455#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,391 INFO L290 TraceCheckUtils]: 58: Hoare triple {9455#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,391 INFO L290 TraceCheckUtils]: 59: Hoare triple {9455#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,391 INFO L290 TraceCheckUtils]: 60: Hoare triple {9455#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-08 08:41:59,391 INFO L290 TraceCheckUtils]: 61: Hoare triple {9455#false} assume 8640 == #t~mem75;havoc #t~mem75; {9455#false} is VALID [2022-04-08 08:41:59,391 INFO L290 TraceCheckUtils]: 62: Hoare triple {9455#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9455#false} is VALID [2022-04-08 08:41:59,391 INFO L290 TraceCheckUtils]: 63: Hoare triple {9455#false} assume !(4 == ~blastFlag~0); {9455#false} is VALID [2022-04-08 08:41:59,391 INFO L290 TraceCheckUtils]: 64: Hoare triple {9455#false} assume !(7 == ~blastFlag~0); {9455#false} is VALID [2022-04-08 08:41:59,391 INFO L290 TraceCheckUtils]: 65: Hoare triple {9455#false} assume 10 == ~blastFlag~0; {9455#false} is VALID [2022-04-08 08:41:59,391 INFO L290 TraceCheckUtils]: 66: Hoare triple {9455#false} assume !false; {9455#false} is VALID [2022-04-08 08:41:59,391 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-08 08:41:59,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:59,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179695630] [2022-04-08 08:41:59,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179695630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:59,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:59,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:59,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:59,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1454047534] [2022-04-08 08:41:59,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1454047534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:59,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:59,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:59,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443695234] [2022-04-08 08:41:59,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:59,393 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-08 08:41:59,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:59,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:59,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:59,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:59,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:59,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:59,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:59,443 INFO L87 Difference]: Start difference. First operand 433 states and 648 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:01,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:02,738 INFO L93 Difference]: Finished difference Result 614 states and 926 transitions. [2022-04-08 08:42:02,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:02,739 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-08 08:42:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-08 08:42:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-08 08:42:02,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-08 08:42:03,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:03,077 INFO L225 Difference]: With dead ends: 614 [2022-04-08 08:42:03,077 INFO L226 Difference]: Without dead ends: 475 [2022-04-08 08:42:03,077 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:42:03,078 INFO L913 BasicCegarLoop]: 243 mSDtfsCounter, 33 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:03,078 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 601 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 447 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:42:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-08 08:42:03,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 455. [2022-04-08 08:42:03,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:03,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 455 states, 450 states have (on average 1.5133333333333334) internal successors, (681), 450 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:03,090 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 455 states, 450 states have (on average 1.5133333333333334) internal successors, (681), 450 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:03,091 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 455 states, 450 states have (on average 1.5133333333333334) internal successors, (681), 450 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:03,099 INFO L93 Difference]: Finished difference Result 475 states and 711 transitions. [2022-04-08 08:42:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 711 transitions. [2022-04-08 08:42:03,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:03,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:03,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 455 states, 450 states have (on average 1.5133333333333334) internal successors, (681), 450 states have internal predecessors, (681), 3 states have call successors, (3), 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 475 states. [2022-04-08 08:42:03,102 INFO L87 Difference]: Start difference. First operand has 455 states, 450 states have (on average 1.5133333333333334) internal successors, (681), 450 states have internal predecessors, (681), 3 states have call successors, (3), 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 475 states. [2022-04-08 08:42:03,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:03,111 INFO L93 Difference]: Finished difference Result 475 states and 711 transitions. [2022-04-08 08:42:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 711 transitions. [2022-04-08 08:42:03,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:03,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:03,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:03,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 450 states have (on average 1.5133333333333334) internal successors, (681), 450 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 685 transitions. [2022-04-08 08:42:03,122 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 685 transitions. Word has length 67 [2022-04-08 08:42:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:03,122 INFO L478 AbstractCegarLoop]: Abstraction has 455 states and 685 transitions. [2022-04-08 08:42:03,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:03,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 455 states and 685 transitions. [2022-04-08 08:42:03,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 685 edges. 685 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 685 transitions. [2022-04-08 08:42:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 08:42:03,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:03,636 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:03,636 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:42:03,636 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:03,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:03,636 INFO L85 PathProgramCache]: Analyzing trace with hash 520696844, now seen corresponding path program 1 times [2022-04-08 08:42:03,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:03,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [570179887] [2022-04-08 08:42:03,670 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:03,670 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:03,670 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash 520696844, now seen corresponding path program 2 times [2022-04-08 08:42:03,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:03,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949963259] [2022-04-08 08:42:03,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:03,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:03,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:03,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {12561#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {12554#true} is VALID [2022-04-08 08:42:03,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {12554#true} assume true; {12554#true} is VALID [2022-04-08 08:42:03,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12554#true} {12554#true} #693#return; {12554#true} is VALID [2022-04-08 08:42:03,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {12554#true} call ULTIMATE.init(); {12561#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:42:03,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {12561#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {12554#true} is VALID [2022-04-08 08:42:03,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {12554#true} assume true; {12554#true} is VALID [2022-04-08 08:42:03,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12554#true} {12554#true} #693#return; {12554#true} is VALID [2022-04-08 08:42:03,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {12554#true} call #t~ret161 := main(); {12554#true} is VALID [2022-04-08 08:42:03,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {12554#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12554#true} is VALID [2022-04-08 08:42:03,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {12554#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12554#true} is VALID [2022-04-08 08:42:03,804 INFO L272 TraceCheckUtils]: 7: Hoare triple {12554#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12554#true} is VALID [2022-04-08 08:42:03,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {12554#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12554#true} is VALID [2022-04-08 08:42:03,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {12554#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {12554#true} is VALID [2022-04-08 08:42:03,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {12554#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {12554#true} is VALID [2022-04-08 08:42:03,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {12554#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12554#true} is VALID [2022-04-08 08:42:03,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {12554#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12554#true} is VALID [2022-04-08 08:42:03,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {12554#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {12554#true} is VALID [2022-04-08 08:42:03,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {12554#true} assume !false; {12554#true} is VALID [2022-04-08 08:42:03,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {12554#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-08 08:42:03,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {12554#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-08 08:42:03,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {12554#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-08 08:42:03,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {12554#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-08 08:42:03,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {12554#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-08 08:42:03,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {12554#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-08 08:42:03,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {12554#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-08 08:42:03,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {12554#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-08 08:42:03,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {12554#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-08 08:42:03,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {12554#true} assume 8464 == #t~mem55;havoc #t~mem55; {12554#true} is VALID [2022-04-08 08:42:03,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {12554#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {12554#true} is VALID [2022-04-08 08:42:03,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {12554#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12554#true} is VALID [2022-04-08 08:42:03,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {12554#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); {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:03,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:03,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:03,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:03,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:03,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:03,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:03,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:03,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:03,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:03,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {12559#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12560#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-08 08:42:03,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {12560#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {12555#false} is VALID [2022-04-08 08:42:03,810 INFO L290 TraceCheckUtils]: 39: Hoare triple {12555#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {12555#false} is VALID [2022-04-08 08:42:03,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {12555#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,810 INFO L290 TraceCheckUtils]: 41: Hoare triple {12555#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {12555#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {12555#false} ~skip~0 := 0; {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {12555#false} assume !false; {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {12555#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {12555#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {12555#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {12555#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {12555#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 50: Hoare triple {12555#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 51: Hoare triple {12555#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 52: Hoare triple {12555#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 53: Hoare triple {12555#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 54: Hoare triple {12555#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 55: Hoare triple {12555#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 56: Hoare triple {12555#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,811 INFO L290 TraceCheckUtils]: 57: Hoare triple {12555#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 58: Hoare triple {12555#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 59: Hoare triple {12555#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {12555#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {12555#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 62: Hoare triple {12555#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 63: Hoare triple {12555#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 64: Hoare triple {12555#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 65: Hoare triple {12555#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 66: Hoare triple {12555#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 67: Hoare triple {12555#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 68: Hoare triple {12555#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 69: Hoare triple {12555#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 70: Hoare triple {12555#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 71: Hoare triple {12555#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 72: Hoare triple {12555#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 73: Hoare triple {12555#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-08 08:42:03,812 INFO L290 TraceCheckUtils]: 74: Hoare triple {12555#false} assume 8640 == #t~mem75;havoc #t~mem75; {12555#false} is VALID [2022-04-08 08:42:03,813 INFO L290 TraceCheckUtils]: 75: Hoare triple {12555#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12555#false} is VALID [2022-04-08 08:42:03,813 INFO L290 TraceCheckUtils]: 76: Hoare triple {12555#false} assume !(4 == ~blastFlag~0); {12555#false} is VALID [2022-04-08 08:42:03,813 INFO L290 TraceCheckUtils]: 77: Hoare triple {12555#false} assume !(7 == ~blastFlag~0); {12555#false} is VALID [2022-04-08 08:42:03,813 INFO L290 TraceCheckUtils]: 78: Hoare triple {12555#false} assume 10 == ~blastFlag~0; {12555#false} is VALID [2022-04-08 08:42:03,813 INFO L290 TraceCheckUtils]: 79: Hoare triple {12555#false} assume !false; {12555#false} is VALID [2022-04-08 08:42:03,813 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-08 08:42:03,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:03,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949963259] [2022-04-08 08:42:03,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949963259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:03,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:03,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:03,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:03,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [570179887] [2022-04-08 08:42:03,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [570179887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:03,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:03,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:03,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248376567] [2022-04-08 08:42:03,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:03,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 08:42:03,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:03,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:03,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:03,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:03,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:03,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:03,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:03,896 INFO L87 Difference]: Start difference. First operand 455 states and 685 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:09,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:13,738 INFO L93 Difference]: Finished difference Result 1215 states and 1841 transitions. [2022-04-08 08:42:13,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:13,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 08:42:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-08 08:42:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-08 08:42:13,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-08 08:42:14,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:14,187 INFO L225 Difference]: With dead ends: 1215 [2022-04-08 08:42:14,187 INFO L226 Difference]: Without dead ends: 786 [2022-04-08 08:42:14,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:42:14,189 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 145 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:14,189 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 364 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-08 08:42:14,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2022-04-08 08:42:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 492. [2022-04-08 08:42:14,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:14,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 786 states. Second operand has 492 states, 487 states have (on average 1.517453798767967) internal successors, (739), 487 states have internal predecessors, (739), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:14,210 INFO L74 IsIncluded]: Start isIncluded. First operand 786 states. Second operand has 492 states, 487 states have (on average 1.517453798767967) internal successors, (739), 487 states have internal predecessors, (739), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:14,210 INFO L87 Difference]: Start difference. First operand 786 states. Second operand has 492 states, 487 states have (on average 1.517453798767967) internal successors, (739), 487 states have internal predecessors, (739), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:14,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:14,231 INFO L93 Difference]: Finished difference Result 786 states and 1188 transitions. [2022-04-08 08:42:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1188 transitions. [2022-04-08 08:42:14,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:14,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:14,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 492 states, 487 states have (on average 1.517453798767967) internal successors, (739), 487 states have internal predecessors, (739), 3 states have call successors, (3), 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 786 states. [2022-04-08 08:42:14,234 INFO L87 Difference]: Start difference. First operand has 492 states, 487 states have (on average 1.517453798767967) internal successors, (739), 487 states have internal predecessors, (739), 3 states have call successors, (3), 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 786 states. [2022-04-08 08:42:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:14,254 INFO L93 Difference]: Finished difference Result 786 states and 1188 transitions. [2022-04-08 08:42:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1188 transitions. [2022-04-08 08:42:14,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:14,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:14,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:14,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 487 states have (on average 1.517453798767967) internal successors, (739), 487 states have internal predecessors, (739), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 743 transitions. [2022-04-08 08:42:14,269 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 743 transitions. Word has length 80 [2022-04-08 08:42:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:14,269 INFO L478 AbstractCegarLoop]: Abstraction has 492 states and 743 transitions. [2022-04-08 08:42:14,269 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:14,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 492 states and 743 transitions. [2022-04-08 08:42:14,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 743 edges. 743 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 743 transitions. [2022-04-08 08:42:14,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 08:42:14,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:14,909 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:14,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:42:14,909 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:14,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:14,910 INFO L85 PathProgramCache]: Analyzing trace with hash -763615238, now seen corresponding path program 1 times [2022-04-08 08:42:14,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:14,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [446838038] [2022-04-08 08:42:15,048 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:42:15,049 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:15,049 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:15,049 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 08:42:15,054 INFO L158 Benchmark]: Toolchain (without parser) took 65476.58ms. Allocated memory was 184.5MB in the beginning and 294.6MB in the end (delta: 110.1MB). Free memory was 132.4MB in the beginning and 209.9MB in the end (delta: -77.5MB). Peak memory consumption was 34.1MB. Max. memory is 8.0GB. [2022-04-08 08:42:15,054 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 184.5MB. Free memory was 151.8MB in the beginning and 151.7MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:42:15,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.80ms. Allocated memory was 184.5MB in the beginning and 245.4MB in the end (delta: 60.8MB). Free memory was 132.3MB in the beginning and 196.8MB in the end (delta: -64.5MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2022-04-08 08:42:15,055 INFO L158 Benchmark]: Boogie Preprocessor took 90.77ms. Allocated memory is still 245.4MB. Free memory was 196.8MB in the beginning and 186.9MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 08:42:15,055 INFO L158 Benchmark]: RCFGBuilder took 1399.49ms. Allocated memory is still 245.4MB. Free memory was 186.9MB in the beginning and 159.9MB in the end (delta: 27.0MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2022-04-08 08:42:15,055 INFO L158 Benchmark]: TraceAbstraction took 63484.14ms. Allocated memory was 245.4MB in the beginning and 294.6MB in the end (delta: 49.3MB). Free memory was 159.4MB in the beginning and 209.9MB in the end (delta: -50.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:42:15,056 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.08ms. Allocated memory is still 184.5MB. Free memory was 151.8MB in the beginning and 151.7MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 494.80ms. Allocated memory was 184.5MB in the beginning and 245.4MB in the end (delta: 60.8MB). Free memory was 132.3MB in the beginning and 196.8MB in the end (delta: -64.5MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 90.77ms. Allocated memory is still 245.4MB. Free memory was 196.8MB in the beginning and 186.9MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1399.49ms. Allocated memory is still 245.4MB. Free memory was 186.9MB in the beginning and 159.9MB in the end (delta: 27.0MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 63484.14ms. Allocated memory was 245.4MB in the beginning and 294.6MB in the end (delta: 49.3MB). Free memory was 159.4MB in the beginning and 209.9MB in the end (delta: -50.5MB). 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-08 08:42:15,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...