/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.07.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 18:18:50,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 18:18:50,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 18:18:50,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 18:18:50,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 18:18:50,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 18:18:50,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 18:18:50,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 18:18:50,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 18:18:50,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 18:18:50,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 18:18:50,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 18:18:50,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 18:18:50,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 18:18:50,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 18:18:50,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 18:18:50,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 18:18:50,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 18:18:50,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 18:18:50,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 18:18:50,970 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 18:18:50,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 18:18:50,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 18:18:50,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 18:18:50,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 18:18:50,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 18:18:50,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 18:18:50,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 18:18:50,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 18:18:50,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 18:18:50,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 18:18:50,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 18:18:50,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 18:18:50,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 18:18:50,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 18:18:50,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 18:18:50,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 18:18:50,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 18:18:50,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 18:18:50,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 18:18:50,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 18:18:50,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 18:18:50,998 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 18:18:51,006 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 18:18:51,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 18:18:51,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 18:18:51,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 18:18:51,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 18:18:51,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 18:18:51,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 18:18:51,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 18:18:51,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 18:18:51,008 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 18:18:51,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 18:18:51,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 18:18:51,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 18:18:51,009 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 18:18:51,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 18:18:51,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:18:51,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 18:18:51,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 18:18:51,009 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 18:18:51,010 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 18:18:51,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 18:18:51,010 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 18:18:51,010 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 18:18:51,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 18:18:51,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 18:18:51,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 18:18:51,199 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 18:18:51,200 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 18:18:51,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.07.i.cil-2.c [2022-04-15 18:18:51,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2caedd166/3fb2b1010230450fb17a59d8646b513e/FLAG5926aecaa [2022-04-15 18:18:51,678 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 18:18:51,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.07.i.cil-2.c [2022-04-15 18:18:51,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2caedd166/3fb2b1010230450fb17a59d8646b513e/FLAG5926aecaa [2022-04-15 18:18:51,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2caedd166/3fb2b1010230450fb17a59d8646b513e [2022-04-15 18:18:51,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 18:18:51,728 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 18:18:51,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 18:18:51,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 18:18:51,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 18:18:51,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:18:51" (1/1) ... [2022-04-15 18:18:51,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7911695b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:18:51, skipping insertion in model container [2022-04-15 18:18:51,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:18:51" (1/1) ... [2022-04-15 18:18:51,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 18:18:51,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 18:18:52,082 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.07.i.cil-2.c[74369,74382] [2022-04-15 18:18:52,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:18:52,112 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 18:18:52,227 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.07.i.cil-2.c[74369,74382] [2022-04-15 18:18:52,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:18:52,251 INFO L208 MainTranslator]: Completed translation [2022-04-15 18:18:52,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:18:52 WrapperNode [2022-04-15 18:18:52,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 18:18:52,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 18:18:52,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 18:18:52,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 18:18:52,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:18:52" (1/1) ... [2022-04-15 18:18:52,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:18:52" (1/1) ... [2022-04-15 18:18:52,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:18:52" (1/1) ... [2022-04-15 18:18:52,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:18:52" (1/1) ... [2022-04-15 18:18:52,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:18:52" (1/1) ... [2022-04-15 18:18:52,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:18:52" (1/1) ... [2022-04-15 18:18:52,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:18:52" (1/1) ... [2022-04-15 18:18:52,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 18:18:52,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 18:18:52,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 18:18:52,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 18:18:52,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:18:52" (1/1) ... [2022-04-15 18:18:52,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:18:52,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 18:18:52,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 18:18:52,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 18:18:52,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 18:18:52,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 18:18:52,436 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 18:18:52,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-15 18:18:52,437 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-15 18:18:52,437 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 18:18:52,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 18:18:52,437 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 18:18:52,437 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 18:18:52,437 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 18:18:52,437 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 18:18:52,438 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 18:18:52,438 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 18:18:52,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 18:18:52,438 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 18:18:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 18:18:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 18:18:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 18:18:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 18:18:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 18:18:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-15 18:18:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 18:18:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 18:18:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-15 18:18:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 18:18:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 18:18:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 18:18:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 18:18:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 18:18:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 18:18:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 18:18:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 18:18:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 18:18:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 18:18:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 18:18:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 18:18:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 18:18:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 18:18:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 18:18:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 18:18:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 18:18:52,548 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 18:18:52,549 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 18:18:53,107 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:18:53,640 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-15 18:18:53,641 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-15 18:18:53,652 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 18:18:53,698 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 18:18:53,699 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 18:18:53,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:18:53 BoogieIcfgContainer [2022-04-15 18:18:53,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 18:18:53,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 18:18:53,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 18:18:53,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 18:18:53,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:18:51" (1/3) ... [2022-04-15 18:18:53,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdbf8fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:18:53, skipping insertion in model container [2022-04-15 18:18:53,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:18:52" (2/3) ... [2022-04-15 18:18:53,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdbf8fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:18:53, skipping insertion in model container [2022-04-15 18:18:53,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:18:53" (3/3) ... [2022-04-15 18:18:53,714 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-2.c [2022-04-15 18:18:53,747 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 18:18:53,748 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 18:18:53,801 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 18:18:53,815 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 18:18:53,815 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 18:18:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 18:18:53,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 18:18:53,849 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:18:53,850 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] [2022-04-15 18:18:53,850 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:18:53,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:18:53,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 1 times [2022-04-15 18:18:53,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:18:53,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1810431319] [2022-04-15 18:18:53,877 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:18:53,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 2 times [2022-04-15 18:18:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:18:53,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812519311] [2022-04-15 18:18:53,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:18:53,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:18:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:54,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:18:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:54,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(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(196, 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); {161#true} is VALID [2022-04-15 18:18:54,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-15 18:18:54,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-15 18:18:54,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:18:54,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(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(196, 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); {161#true} is VALID [2022-04-15 18:18:54,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-15 18:18:54,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-15 18:18:54,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-15 18:18:54,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {161#true} is VALID [2022-04-15 18:18:54,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {161#true} is VALID [2022-04-15 18:18:54,350 INFO L272 TraceCheckUtils]: 7: Hoare triple {161#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {161#true} is VALID [2022-04-15 18:18:54,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:18:54,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {167#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-15 18:18:54,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {167#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {162#false} is VALID [2022-04-15 18:18:54,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {162#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {162#false} is VALID [2022-04-15 18:18:54,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {162#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {162#false} is VALID [2022-04-15 18:18:54,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {162#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {162#false} is VALID [2022-04-15 18:18:54,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {162#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {162#false} is VALID [2022-04-15 18:18:54,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {162#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {162#false} is VALID [2022-04-15 18:18:54,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {162#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {162#false} is VALID [2022-04-15 18:18:54,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 8 == ~blastFlag~0; {162#false} is VALID [2022-04-15 18:18:54,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-15 18:18:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:18:54,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:18:54,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812519311] [2022-04-15 18:18:54,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812519311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:18:54,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:18:54,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:18:54,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:18:54,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1810431319] [2022-04-15 18:18:54,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1810431319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:18:54,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:18:54,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:18:54,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153877618] [2022-04-15 18:18:54,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:18:54,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 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 42 [2022-04-15 18:18:54,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:18:54,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:54,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:18:54,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:18:54,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:18:54,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:18:54,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:18:54,493 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 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 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:01,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:03,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:05,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:05,210 INFO L93 Difference]: Finished difference Result 428 states and 723 transitions. [2022-04-15 18:19:05,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:19:05,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 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 42 [2022-04-15 18:19:05,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:19:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-04-15 18:19:05,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-04-15 18:19:05,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 723 transitions. [2022-04-15 18:19:05,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 723 edges. 723 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:05,754 INFO L225 Difference]: With dead ends: 428 [2022-04-15 18:19:05,754 INFO L226 Difference]: Without dead ends: 259 [2022-04-15 18:19:05,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:19:05,758 INFO L913 BasicCegarLoop]: 157 mSDtfsCounter, 163 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-15 18:19:05,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 461 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-15 18:19:05,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-15 18:19:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 170. [2022-04-15 18:19:05,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:19:05,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:05,790 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:05,790 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:05,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:05,799 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2022-04-15 18:19:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2022-04-15 18:19:05,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:05,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:05,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-15 18:19:05,801 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-15 18:19:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:05,809 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2022-04-15 18:19:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2022-04-15 18:19:05,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:05,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:05,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:19:05,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:19:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-15 18:19:05,816 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-15 18:19:05,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:19:05,816 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-15 18:19:05,817 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:05,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 265 transitions. [2022-04-15 18:19:06,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-15 18:19:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 18:19:06,011 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:19:06,011 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] [2022-04-15 18:19:06,011 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 18:19:06,012 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:19:06,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:19:06,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 1 times [2022-04-15 18:19:06,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:06,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1560588422] [2022-04-15 18:19:06,013 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:19:06,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 2 times [2022-04-15 18:19:06,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:19:06,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869479540] [2022-04-15 18:19:06,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:19:06,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:19:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:06,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:19:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:06,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {1894#(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(196, 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); {1887#true} is VALID [2022-04-15 18:19:06,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {1887#true} assume true; {1887#true} is VALID [2022-04-15 18:19:06,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1887#true} {1887#true} #689#return; {1887#true} is VALID [2022-04-15 18:19:06,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {1887#true} call ULTIMATE.init(); {1894#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:19:06,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {1894#(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(196, 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); {1887#true} is VALID [2022-04-15 18:19:06,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {1887#true} assume true; {1887#true} is VALID [2022-04-15 18:19:06,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1887#true} {1887#true} #689#return; {1887#true} is VALID [2022-04-15 18:19:06,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {1887#true} call #t~ret161 := main(); {1887#true} is VALID [2022-04-15 18:19:06,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {1887#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1887#true} is VALID [2022-04-15 18:19:06,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {1887#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1887#true} is VALID [2022-04-15 18:19:06,209 INFO L272 TraceCheckUtils]: 7: Hoare triple {1887#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1887#true} is VALID [2022-04-15 18:19:06,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {1887#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:06,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1893#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-15 18:19:06,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {1893#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {1888#false} is VALID [2022-04-15 18:19:06,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {1888#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {1888#false} is VALID [2022-04-15 18:19:06,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {1888#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {1888#false} is VALID [2022-04-15 18:19:06,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {1888#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {1888#false} is VALID [2022-04-15 18:19:06,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {1888#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {1888#false} is VALID [2022-04-15 18:19:06,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {1888#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {1888#false} is VALID [2022-04-15 18:19:06,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {1888#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {1888#false} is VALID [2022-04-15 18:19:06,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {1888#false} assume 8 == ~blastFlag~0; {1888#false} is VALID [2022-04-15 18:19:06,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {1888#false} assume !false; {1888#false} is VALID [2022-04-15 18:19:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:19:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:19:06,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869479540] [2022-04-15 18:19:06,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869479540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:06,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:06,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:06,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:19:06,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1560588422] [2022-04-15 18:19:06,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1560588422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:06,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:06,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:06,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712636169] [2022-04-15 18:19:06,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:19:06,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 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 43 [2022-04-15 18:19:06,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:19:06,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:06,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:06,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:19:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:06,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:19:06,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:19:06,289 INFO L87 Difference]: Start difference. First operand 170 states and 265 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:08,207 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:10,212 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:12,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:14,925 INFO L93 Difference]: Finished difference Result 442 states and 693 transitions. [2022-04-15 18:19:14,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:19:14,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 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 43 [2022-04-15 18:19:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:19:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-15 18:19:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-15 18:19:14,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-15 18:19:15,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:15,404 INFO L225 Difference]: With dead ends: 442 [2022-04-15 18:19:15,405 INFO L226 Difference]: Without dead ends: 287 [2022-04-15 18:19:15,405 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:19:15,406 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 130 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 64 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-15 18:19:15,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 475 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-04-15 18:19:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-15 18:19:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 199. [2022-04-15 18:19:15,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:19:15,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:15,418 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:15,419 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:15,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:15,425 INFO L93 Difference]: Finished difference Result 287 states and 446 transitions. [2022-04-15 18:19:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 446 transitions. [2022-04-15 18:19:15,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:15,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:15,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 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 287 states. [2022-04-15 18:19:15,427 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 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 287 states. [2022-04-15 18:19:15,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:15,434 INFO L93 Difference]: Finished difference Result 287 states and 446 transitions. [2022-04-15 18:19:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 446 transitions. [2022-04-15 18:19:15,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:15,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:15,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:19:15,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:19:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-15 18:19:15,439 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-15 18:19:15,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:19:15,440 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-15 18:19:15,440 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:15,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 317 transitions. [2022-04-15 18:19:15,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-15 18:19:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 18:19:15,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:19:15,658 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:19:15,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 18:19:15,658 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:19:15,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:19:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 1 times [2022-04-15 18:19:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:15,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2082276651] [2022-04-15 18:19:15,659 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:19:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 2 times [2022-04-15 18:19:15,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:19:15,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397989015] [2022-04-15 18:19:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:19:15,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:19:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:15,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:19:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:15,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {3762#(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(196, 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); {3755#true} is VALID [2022-04-15 18:19:15,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {3755#true} assume true; {3755#true} is VALID [2022-04-15 18:19:15,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3755#true} {3755#true} #689#return; {3755#true} is VALID [2022-04-15 18:19:15,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {3755#true} call ULTIMATE.init(); {3762#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:19:15,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {3762#(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(196, 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); {3755#true} is VALID [2022-04-15 18:19:15,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {3755#true} assume true; {3755#true} is VALID [2022-04-15 18:19:15,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3755#true} {3755#true} #689#return; {3755#true} is VALID [2022-04-15 18:19:15,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {3755#true} call #t~ret161 := main(); {3755#true} is VALID [2022-04-15 18:19:15,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {3755#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3755#true} is VALID [2022-04-15 18:19:15,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {3755#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {3755#true} is VALID [2022-04-15 18:19:15,791 INFO L272 TraceCheckUtils]: 7: Hoare triple {3755#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3755#true} is VALID [2022-04-15 18:19:15,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {3755#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !false; {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,806 INFO L290 TraceCheckUtils]: 39: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-15 18:19:15,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {3761#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-15 18:19:15,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {3761#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {3756#false} is VALID [2022-04-15 18:19:15,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {3756#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3756#false} is VALID [2022-04-15 18:19:15,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {3756#false} assume 4 == ~blastFlag~0; {3756#false} is VALID [2022-04-15 18:19:15,808 INFO L290 TraceCheckUtils]: 47: Hoare triple {3756#false} assume !false; {3756#false} is VALID [2022-04-15 18:19:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:19:15,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:19:15,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397989015] [2022-04-15 18:19:15,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397989015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:15,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:15,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:15,809 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:19:15,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2082276651] [2022-04-15 18:19:15,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2082276651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:15,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:15,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:15,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490196184] [2022-04-15 18:19:15,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:19:15,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 18:19:15,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:19:15,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:15,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:15,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:19:15,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:15,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:19:15,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:19:15,849 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:19,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:23,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:26,663 INFO L93 Difference]: Finished difference Result 501 states and 796 transitions. [2022-04-15 18:19:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:19:26,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 18:19:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:19:26,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-15 18:19:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-15 18:19:26,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-15 18:19:27,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:27,052 INFO L225 Difference]: With dead ends: 501 [2022-04-15 18:19:27,052 INFO L226 Difference]: Without dead ends: 317 [2022-04-15 18:19:27,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:19:27,053 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 119 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-15 18:19:27,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-15 18:19:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-04-15 18:19:27,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 239. [2022-04-15 18:19:27,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:19:27,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 317 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:27,076 INFO L74 IsIncluded]: Start isIncluded. First operand 317 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:27,076 INFO L87 Difference]: Start difference. First operand 317 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:27,082 INFO L93 Difference]: Finished difference Result 317 states and 497 transitions. [2022-04-15 18:19:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 497 transitions. [2022-04-15 18:19:27,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:27,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:27,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 317 states. [2022-04-15 18:19:27,083 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 317 states. [2022-04-15 18:19:27,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:27,088 INFO L93 Difference]: Finished difference Result 317 states and 497 transitions. [2022-04-15 18:19:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 497 transitions. [2022-04-15 18:19:27,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:27,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:27,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:19:27,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:19:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-15 18:19:27,093 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 48 [2022-04-15 18:19:27,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:19:27,094 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-15 18:19:27,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:27,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 388 transitions. [2022-04-15 18:19:27,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-15 18:19:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 18:19:27,345 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:19:27,346 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:19:27,346 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 18:19:27,346 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:19:27,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:19:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 1 times [2022-04-15 18:19:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:27,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [143553379] [2022-04-15 18:19:27,347 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:19:27,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 2 times [2022-04-15 18:19:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:19:27,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416463552] [2022-04-15 18:19:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:19:27,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:19:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:27,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:19:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:27,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {5888#(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(196, 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); {5881#true} is VALID [2022-04-15 18:19:27,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {5881#true} assume true; {5881#true} is VALID [2022-04-15 18:19:27,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5881#true} {5881#true} #689#return; {5881#true} is VALID [2022-04-15 18:19:27,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {5881#true} call ULTIMATE.init(); {5888#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:19:27,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {5888#(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(196, 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); {5881#true} is VALID [2022-04-15 18:19:27,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {5881#true} assume true; {5881#true} is VALID [2022-04-15 18:19:27,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5881#true} {5881#true} #689#return; {5881#true} is VALID [2022-04-15 18:19:27,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {5881#true} call #t~ret161 := main(); {5881#true} is VALID [2022-04-15 18:19:27,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {5881#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5881#true} is VALID [2022-04-15 18:19:27,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {5881#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {5881#true} is VALID [2022-04-15 18:19:27,457 INFO L272 TraceCheckUtils]: 7: Hoare triple {5881#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5881#true} is VALID [2022-04-15 18:19:27,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {5881#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:27,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5887#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-15 18:19:27,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {5887#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {5882#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {5882#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {5882#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {5882#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {5882#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {5882#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {5882#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {5882#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {5882#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {5882#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {5882#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {5882#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {5882#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {5882#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,466 INFO L290 TraceCheckUtils]: 39: Hoare triple {5882#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,466 INFO L290 TraceCheckUtils]: 40: Hoare triple {5882#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,466 INFO L290 TraceCheckUtils]: 41: Hoare triple {5882#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {5882#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {5882#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {5882#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-15 18:19:27,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {5882#false} assume 8641 == #t~mem76;havoc #t~mem76; {5882#false} is VALID [2022-04-15 18:19:27,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {5882#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5882#false} is VALID [2022-04-15 18:19:27,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {5882#false} assume 4 == ~blastFlag~0; {5882#false} is VALID [2022-04-15 18:19:27,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {5882#false} assume !false; {5882#false} is VALID [2022-04-15 18:19:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:19:27,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:19:27,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416463552] [2022-04-15 18:19:27,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416463552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:27,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:27,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:27,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:19:27,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [143553379] [2022-04-15 18:19:27,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [143553379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:27,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:27,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:27,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267818655] [2022-04-15 18:19:27,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:19:27,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 18:19:27,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:19:27,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:27,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:27,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:19:27,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:27,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:19:27,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:19:27,507 INFO L87 Difference]: Start difference. First operand 239 states and 388 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:29,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:33,214 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:36,620 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:40,196 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:41,182 INFO L93 Difference]: Finished difference Result 491 states and 798 transitions. [2022-04-15 18:19:41,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:19:41,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 18:19:41,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:19:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-15 18:19:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-15 18:19:41,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-15 18:19:41,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:41,500 INFO L225 Difference]: With dead ends: 491 [2022-04-15 18:19:41,500 INFO L226 Difference]: Without dead ends: 267 [2022-04-15 18:19:41,501 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:19:41,501 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:19:41,502 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 481 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-04-15 18:19:41,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-15 18:19:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-15 18:19:41,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:19:41,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:41,517 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:41,518 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:41,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:41,524 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-15 18:19:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-15 18:19:41,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:41,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:41,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 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 267 states. [2022-04-15 18:19:41,526 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 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 267 states. [2022-04-15 18:19:41,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:41,532 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-15 18:19:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-15 18:19:41,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:41,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:41,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:19:41,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:19:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 407 transitions. [2022-04-15 18:19:41,539 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 407 transitions. Word has length 49 [2022-04-15 18:19:41,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:19:41,540 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 407 transitions. [2022-04-15 18:19:41,540 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:41,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 407 transitions. [2022-04-15 18:19:41,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 407 transitions. [2022-04-15 18:19:41,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 18:19:41,824 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:19:41,824 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] [2022-04-15 18:19:41,824 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 18:19:41,825 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:19:41,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:19:41,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1174088998, now seen corresponding path program 1 times [2022-04-15 18:19:41,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:41,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1282051400] [2022-04-15 18:19:41,855 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 18:19:41,855 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:19:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1174088998, now seen corresponding path program 2 times [2022-04-15 18:19:41,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:19:41,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447392148] [2022-04-15 18:19:41,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:19:41,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:19:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:42,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:19:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:42,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {7916#(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(196, 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); {7909#true} is VALID [2022-04-15 18:19:42,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {7909#true} assume true; {7909#true} is VALID [2022-04-15 18:19:42,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7909#true} {7909#true} #689#return; {7909#true} is VALID [2022-04-15 18:19:42,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {7909#true} call ULTIMATE.init(); {7916#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:19:42,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {7916#(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(196, 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); {7909#true} is VALID [2022-04-15 18:19:42,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {7909#true} assume true; {7909#true} is VALID [2022-04-15 18:19:42,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7909#true} {7909#true} #689#return; {7909#true} is VALID [2022-04-15 18:19:42,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {7909#true} call #t~ret161 := main(); {7909#true} is VALID [2022-04-15 18:19:42,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {7909#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7909#true} is VALID [2022-04-15 18:19:42,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {7909#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {7909#true} is VALID [2022-04-15 18:19:42,038 INFO L272 TraceCheckUtils]: 7: Hoare triple {7909#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7909#true} is VALID [2022-04-15 18:19:42,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {7909#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:42,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:42,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:42,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:42,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:42,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:42,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:42,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:42,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:42,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:42,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:42,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:42,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7915#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-15 18:19:42,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {7915#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {7910#false} is VALID [2022-04-15 18:19:42,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {7910#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {7910#false} is VALID [2022-04-15 18:19:42,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {7910#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {7910#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {7910#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7910#false} is VALID [2022-04-15 18:19:42,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {7910#false} ~skip~0 := 0; {7910#false} is VALID [2022-04-15 18:19:42,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {7910#false} assume !false; {7910#false} is VALID [2022-04-15 18:19:42,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {7910#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {7910#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {7910#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {7910#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {7910#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {7910#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,074 INFO L290 TraceCheckUtils]: 34: Hoare triple {7910#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {7910#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {7910#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {7910#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {7910#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {7910#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {7910#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {7910#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {7910#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {7910#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {7910#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {7910#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,079 INFO L290 TraceCheckUtils]: 46: Hoare triple {7910#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,079 INFO L290 TraceCheckUtils]: 47: Hoare triple {7910#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,079 INFO L290 TraceCheckUtils]: 48: Hoare triple {7910#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {7910#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {7910#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,080 INFO L290 TraceCheckUtils]: 51: Hoare triple {7910#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,080 INFO L290 TraceCheckUtils]: 52: Hoare triple {7910#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,080 INFO L290 TraceCheckUtils]: 53: Hoare triple {7910#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,080 INFO L290 TraceCheckUtils]: 54: Hoare triple {7910#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,080 INFO L290 TraceCheckUtils]: 55: Hoare triple {7910#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,080 INFO L290 TraceCheckUtils]: 56: Hoare triple {7910#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,080 INFO L290 TraceCheckUtils]: 57: Hoare triple {7910#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-15 18:19:42,080 INFO L290 TraceCheckUtils]: 58: Hoare triple {7910#false} assume 8641 == #t~mem76;havoc #t~mem76; {7910#false} is VALID [2022-04-15 18:19:42,080 INFO L290 TraceCheckUtils]: 59: Hoare triple {7910#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {7910#false} is VALID [2022-04-15 18:19:42,081 INFO L290 TraceCheckUtils]: 60: Hoare triple {7910#false} assume 4 == ~blastFlag~0; {7910#false} is VALID [2022-04-15 18:19:42,081 INFO L290 TraceCheckUtils]: 61: Hoare triple {7910#false} assume !false; {7910#false} is VALID [2022-04-15 18:19:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:19:42,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:19:42,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447392148] [2022-04-15 18:19:42,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447392148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:42,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:42,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:42,082 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:19:42,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1282051400] [2022-04-15 18:19:42,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1282051400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:42,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:42,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:42,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362085892] [2022-04-15 18:19:42,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:19:42,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 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 62 [2022-04-15 18:19:42,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:19:42,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:42,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:42,133 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:19:42,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:42,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:19:42,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:19:42,136 INFO L87 Difference]: Start difference. First operand 250 states and 407 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:44,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:45,111 INFO L93 Difference]: Finished difference Result 491 states and 797 transitions. [2022-04-15 18:19:45,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:19:45,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 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 62 [2022-04-15 18:19:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:19:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-15 18:19:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-15 18:19:45,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-15 18:19:45,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:45,397 INFO L225 Difference]: With dead ends: 491 [2022-04-15 18:19:45,397 INFO L226 Difference]: Without dead ends: 267 [2022-04-15 18:19:45,397 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:19:45,398 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:19:45,398 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 483 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 360 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 18:19:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-15 18:19:45,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-15 18:19:45,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:19:45,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:45,408 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:45,408 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:45,412 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-15 18:19:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-15 18:19:45,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:45,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:45,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 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 267 states. [2022-04-15 18:19:45,414 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 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 267 states. [2022-04-15 18:19:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:45,418 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-15 18:19:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-15 18:19:45,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:45,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:45,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:19:45,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:19:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 406 transitions. [2022-04-15 18:19:45,423 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 406 transitions. Word has length 62 [2022-04-15 18:19:45,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:19:45,423 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 406 transitions. [2022-04-15 18:19:45,423 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:45,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 406 transitions. [2022-04-15 18:19:45,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 406 transitions. [2022-04-15 18:19:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 18:19:45,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:19:45,689 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] [2022-04-15 18:19:45,689 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 18:19:45,689 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:19:45,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:19:45,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1299527402, now seen corresponding path program 1 times [2022-04-15 18:19:45,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:45,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [580380758] [2022-04-15 18:19:45,721 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 18:19:45,722 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:19:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1299527402, now seen corresponding path program 2 times [2022-04-15 18:19:45,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:19:45,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883132659] [2022-04-15 18:19:45,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:19:45,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:19:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:45,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:19:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:45,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {9944#(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(196, 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); {9937#true} is VALID [2022-04-15 18:19:45,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {9937#true} assume true; {9937#true} is VALID [2022-04-15 18:19:45,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9937#true} {9937#true} #689#return; {9937#true} is VALID [2022-04-15 18:19:45,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {9937#true} call ULTIMATE.init(); {9944#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:19:45,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {9944#(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(196, 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); {9937#true} is VALID [2022-04-15 18:19:45,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {9937#true} assume true; {9937#true} is VALID [2022-04-15 18:19:45,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9937#true} {9937#true} #689#return; {9937#true} is VALID [2022-04-15 18:19:45,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {9937#true} call #t~ret161 := main(); {9937#true} is VALID [2022-04-15 18:19:45,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {9937#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9937#true} is VALID [2022-04-15 18:19:45,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {9937#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {9937#true} is VALID [2022-04-15 18:19:45,884 INFO L272 TraceCheckUtils]: 7: Hoare triple {9937#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9937#true} is VALID [2022-04-15 18:19:45,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {9937#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:45,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:45,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:45,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:45,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:45,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:45,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:19:45,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9943#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-15 18:19:45,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {9943#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {9938#false} is VALID [2022-04-15 18:19:45,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {9938#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {9938#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {9938#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {9938#false} is VALID [2022-04-15 18:19:45,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {9938#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {9938#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, 80 + ~s.offset, 8); {9938#false} is VALID [2022-04-15 18:19:45,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {9938#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {9938#false} is VALID [2022-04-15 18:19:45,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {9938#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {9938#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {9938#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {9938#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9938#false} is VALID [2022-04-15 18:19:45,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {9938#false} ~skip~0 := 0; {9938#false} is VALID [2022-04-15 18:19:45,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {9938#false} assume !false; {9938#false} is VALID [2022-04-15 18:19:45,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {9938#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {9938#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {9938#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {9938#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {9938#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {9938#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,891 INFO L290 TraceCheckUtils]: 35: Hoare triple {9938#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {9938#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {9938#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {9938#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {9938#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {9938#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,892 INFO L290 TraceCheckUtils]: 41: Hoare triple {9938#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,892 INFO L290 TraceCheckUtils]: 42: Hoare triple {9938#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,892 INFO L290 TraceCheckUtils]: 43: Hoare triple {9938#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {9938#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {9938#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {9938#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {9938#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {9938#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {9938#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,892 INFO L290 TraceCheckUtils]: 50: Hoare triple {9938#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,892 INFO L290 TraceCheckUtils]: 51: Hoare triple {9938#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,892 INFO L290 TraceCheckUtils]: 52: Hoare triple {9938#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,893 INFO L290 TraceCheckUtils]: 53: Hoare triple {9938#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,893 INFO L290 TraceCheckUtils]: 54: Hoare triple {9938#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,893 INFO L290 TraceCheckUtils]: 55: Hoare triple {9938#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,893 INFO L290 TraceCheckUtils]: 56: Hoare triple {9938#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,893 INFO L290 TraceCheckUtils]: 57: Hoare triple {9938#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,893 INFO L290 TraceCheckUtils]: 58: Hoare triple {9938#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-15 18:19:45,893 INFO L290 TraceCheckUtils]: 59: Hoare triple {9938#false} assume 8641 == #t~mem76;havoc #t~mem76; {9938#false} is VALID [2022-04-15 18:19:45,893 INFO L290 TraceCheckUtils]: 60: Hoare triple {9938#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9938#false} is VALID [2022-04-15 18:19:45,893 INFO L290 TraceCheckUtils]: 61: Hoare triple {9938#false} assume 4 == ~blastFlag~0; {9938#false} is VALID [2022-04-15 18:19:45,893 INFO L290 TraceCheckUtils]: 62: Hoare triple {9938#false} assume !false; {9938#false} is VALID [2022-04-15 18:19:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:19:45,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:19:45,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883132659] [2022-04-15 18:19:45,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883132659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:45,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:45,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:45,895 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:19:45,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [580380758] [2022-04-15 18:19:45,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [580380758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:45,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:45,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420620820] [2022-04-15 18:19:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:19:45,896 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-15 18:19:45,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:19:45,897 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-15 18:19:45,936 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-15 18:19:45,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:19:45,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:45,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:19:45,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:19:45,937 INFO L87 Difference]: Start difference. First operand 250 states and 406 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-15 18:19:47,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:49,154 INFO L93 Difference]: Finished difference Result 561 states and 903 transitions. [2022-04-15 18:19:49,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:19:49,154 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-15 18:19:49,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:19:49,154 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-15 18:19:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-15 18:19:49,157 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-15 18:19:49,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-15 18:19:49,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-15 18:19:49,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:49,598 INFO L225 Difference]: With dead ends: 561 [2022-04-15 18:19:49,598 INFO L226 Difference]: Without dead ends: 337 [2022-04-15 18:19:49,599 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:19:49,599 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 147 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:19:49,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 346 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 472 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 18:19:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-15 18:19:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 250. [2022-04-15 18:19:49,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:19:49,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:49,609 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:49,609 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:49,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:49,615 INFO L93 Difference]: Finished difference Result 337 states and 530 transitions. [2022-04-15 18:19:49,615 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 530 transitions. [2022-04-15 18:19:49,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:49,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:49,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 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 337 states. [2022-04-15 18:19:49,633 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 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 337 states. [2022-04-15 18:19:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:49,638 INFO L93 Difference]: Finished difference Result 337 states and 530 transitions. [2022-04-15 18:19:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 530 transitions. [2022-04-15 18:19:49,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:49,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:49,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:19:49,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:19:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 402 transitions. [2022-04-15 18:19:49,644 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 402 transitions. Word has length 63 [2022-04-15 18:19:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:19:49,644 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 402 transitions. [2022-04-15 18:19:49,644 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-15 18:19:49,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 402 transitions. [2022-04-15 18:19:49,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 402 transitions. [2022-04-15 18:19:49,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 18:19:49,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:19:49,995 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] [2022-04-15 18:19:49,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 18:19:49,995 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:19:49,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:19:49,996 INFO L85 PathProgramCache]: Analyzing trace with hash 252016598, now seen corresponding path program 1 times [2022-04-15 18:19:49,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:49,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1444850359] [2022-04-15 18:19:50,073 ERROR L250 FreeRefinementEngine]: Caught unknown exception: Undeclared function symbol (* (Array Int (Array Int Int)) Int) [2022-04-15 18:19:50,073 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-15 18:19:50,073 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (* (Array Int (Array Int Int)) Int) at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1615) 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.smtlibutils.SmtUtils.mul(SmtUtils.java:597) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrUtils.matrixVectorMultiplicationWithVariables(QvasrUtils.java:226) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.intVasrAbstractionToFormula(QvasrSummarizer.java:177) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:140) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 18:19:50,076 INFO L158 Benchmark]: Toolchain (without parser) took 58347.61ms. Allocated memory was 190.8MB in the beginning and 369.1MB in the end (delta: 178.3MB). Free memory was 161.9MB in the beginning and 267.7MB in the end (delta: -105.8MB). Peak memory consumption was 72.5MB. Max. memory is 8.0GB. [2022-04-15 18:19:50,076 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 190.8MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 18:19:50,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.61ms. Allocated memory was 190.8MB in the beginning and 307.2MB in the end (delta: 116.4MB). Free memory was 161.7MB in the beginning and 253.8MB in the end (delta: -92.1MB). Peak memory consumption was 28.6MB. Max. memory is 8.0GB. [2022-04-15 18:19:50,077 INFO L158 Benchmark]: Boogie Preprocessor took 127.35ms. Allocated memory is still 307.2MB. Free memory was 253.8MB in the beginning and 243.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 18:19:50,077 INFO L158 Benchmark]: RCFGBuilder took 1319.86ms. Allocated memory is still 307.2MB. Free memory was 243.8MB in the beginning and 272.7MB in the end (delta: -28.9MB). Peak memory consumption was 102.9MB. Max. memory is 8.0GB. [2022-04-15 18:19:50,077 INFO L158 Benchmark]: TraceAbstraction took 56372.34ms. Allocated memory was 307.2MB in the beginning and 369.1MB in the end (delta: 61.9MB). Free memory was 272.0MB in the beginning and 267.7MB in the end (delta: 4.3MB). Peak memory consumption was 66.2MB. Max. memory is 8.0GB. [2022-04-15 18:19:50,078 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 190.8MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 523.61ms. Allocated memory was 190.8MB in the beginning and 307.2MB in the end (delta: 116.4MB). Free memory was 161.7MB in the beginning and 253.8MB in the end (delta: -92.1MB). Peak memory consumption was 28.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 127.35ms. Allocated memory is still 307.2MB. Free memory was 253.8MB in the beginning and 243.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1319.86ms. Allocated memory is still 307.2MB. Free memory was 243.8MB in the beginning and 272.7MB in the end (delta: -28.9MB). Peak memory consumption was 102.9MB. Max. memory is 8.0GB. * TraceAbstraction took 56372.34ms. Allocated memory was 307.2MB in the beginning and 369.1MB in the end (delta: 61.9MB). Free memory was 272.0MB in the beginning and 267.7MB in the end (delta: 4.3MB). Peak memory consumption was 66.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (* (Array Int (Array Int Int)) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (* (Array Int (Array Int Int)) Int): de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1615) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 18:19:50,106 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...