/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/s3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:17:45,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:17:45,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:17:45,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:17:45,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:17:45,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:17:45,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:17:45,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:17:45,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:17:45,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:17:45,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:17:45,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:17:45,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:17:45,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:17:45,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:17:45,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:17:45,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:17:45,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:17:45,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:17:45,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:17:45,938 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:17:45,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:17:45,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:17:45,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:17:45,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:17:45,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:17:45,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:17:45,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:17:45,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:17:45,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:17:45,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:17:45,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:17:45,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:17:45,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:17:45,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:17:45,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:17:45,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:17:45,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:17:45,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:17:45,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:17:45,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:17:45,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:17:45,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:17:45,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:17:45,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:17:45,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:17:45,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:17:45,990 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:17:45,991 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:17:45,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:17:45,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:17:45,991 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:17:45,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:17:45,992 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:17:45,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:17:45,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:17:45,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:17:45,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:17:45,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:17:45,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:17:45,993 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:17:45,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:17:45,994 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:17:45,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:17:45,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:17:45,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:17:45,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:17:45,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:17:45,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:17:45,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:17:45,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:17:45,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:17:45,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:17:45,996 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:17:45,996 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:17:45,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:17:45,996 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 10:17:46,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:17:46,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:17:46,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:17:46,245 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:17:46,246 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:17:46,247 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3.i [2022-04-27 10:17:46,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0770f3e3/70581141be68480f9f629e0bf2bca1b9/FLAGf3c58a140 [2022-04-27 10:17:46,798 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:17:46,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i [2022-04-27 10:17:46,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0770f3e3/70581141be68480f9f629e0bf2bca1b9/FLAGf3c58a140 [2022-04-27 10:17:47,321 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0770f3e3/70581141be68480f9f629e0bf2bca1b9 [2022-04-27 10:17:47,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:17:47,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:17:47,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:17:47,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:17:47,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:17:47,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:17:47" (1/1) ... [2022-04-27 10:17:47,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf9aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:47, skipping insertion in model container [2022-04-27 10:17:47,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:17:47" (1/1) ... [2022-04-27 10:17:47,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:17:47,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:17:47,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i[64167,64180] [2022-04-27 10:17:47,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:17:47,735 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:17:47,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i[64167,64180] [2022-04-27 10:17:47,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:17:47,875 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:17:47,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:47 WrapperNode [2022-04-27 10:17:47,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:17:47,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:17:47,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:17:47,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:17:47,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:47" (1/1) ... [2022-04-27 10:17:47,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:47" (1/1) ... [2022-04-27 10:17:47,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:47" (1/1) ... [2022-04-27 10:17:47,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:47" (1/1) ... [2022-04-27 10:17:47,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:47" (1/1) ... [2022-04-27 10:17:47,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:47" (1/1) ... [2022-04-27 10:17:47,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:47" (1/1) ... [2022-04-27 10:17:47,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:17:47,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:17:47,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:17:47,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:17:47,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:47" (1/1) ... [2022-04-27 10:17:48,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:17:48,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:48,019 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-27 10:17:48,021 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-27 10:17:48,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:17:48,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:17:48,050 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:17:48,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-27 10:17:48,052 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-27 10:17:48,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:17:48,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-27 10:17:48,053 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-27 10:17:48,053 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 10:17:48,053 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-27 10:17:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:17:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:17:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:17:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:17:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-27 10:17:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:17:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-27 10:17:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-27 10:17:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-27 10:17:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-27 10:17:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-27 10:17:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-27 10:17:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-27 10:17:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-27 10:17:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-27 10:17:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:17:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 10:17:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-27 10:17:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:17:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:17:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 10:17:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 10:17:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:17:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:17:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:17:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-27 10:17:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-27 10:17:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-27 10:17:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-27 10:17:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:17:48,185 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:17:48,187 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:17:50,259 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-27 10:17:50,757 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-27 10:17:50,757 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-27 10:17:50,768 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:17:50,775 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:17:50,775 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:17:50,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:17:50 BoogieIcfgContainer [2022-04-27 10:17:50,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:17:50,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:17:50,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:17:50,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:17:50,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:17:47" (1/3) ... [2022-04-27 10:17:50,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670a1427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:17:50, skipping insertion in model container [2022-04-27 10:17:50,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:47" (2/3) ... [2022-04-27 10:17:50,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670a1427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:17:50, skipping insertion in model container [2022-04-27 10:17:50,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:17:50" (3/3) ... [2022-04-27 10:17:50,783 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2022-04-27 10:17:50,795 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:17:50,795 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:17:50,840 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:17:50,845 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4270e7cf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@175c53ff [2022-04-27 10:17:50,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:17:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 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-27 10:17:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 10:17:50,860 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:50,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:50,861 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:50,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:50,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 1 times [2022-04-27 10:17:50,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:50,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160128754] [2022-04-27 10:17:50,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:50,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:51,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:51,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {149#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-27 10:17:51,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-27 10:17:51,394 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-27 10:17:51,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {143#true} call ULTIMATE.init(); {149#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:51,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-27 10:17:51,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-27 10:17:51,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-27 10:17:51,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {143#true} call #t~ret159 := main(); {143#true} is VALID [2022-04-27 10:17:51,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {143#true} is VALID [2022-04-27 10:17:51,403 INFO L272 TraceCheckUtils]: 6: Hoare triple {143#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {143#true} is VALID [2022-04-27 10:17:51,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !false; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem56;havoc #t~mem56; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 10:17:51,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {144#false} is VALID [2022-04-27 10:17:51,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {144#false} assume !false; {144#false} is VALID [2022-04-27 10:17:51,416 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-27 10:17:51,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:51,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160128754] [2022-04-27 10:17:51,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160128754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:51,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:51,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:17:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550634397] [2022-04-27 10:17:51,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:51,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 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 30 [2022-04-27 10:17:51,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:51,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:51,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:51,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:17:51,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:51,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:17:51,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:17:51,494 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 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 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:54,671 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:17:56,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:17:58,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:17:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:59,747 INFO L93 Difference]: Finished difference Result 385 states and 637 transitions. [2022-04-27 10:17:59,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:17:59,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 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 30 [2022-04-27 10:17:59,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 637 transitions. [2022-04-27 10:17:59,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 637 transitions. [2022-04-27 10:17:59,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 637 transitions. [2022-04-27 10:18:00,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 637 edges. 637 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:00,333 INFO L225 Difference]: With dead ends: 385 [2022-04-27 10:18:00,333 INFO L226 Difference]: Without dead ends: 223 [2022-04-27 10:18:00,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:18:00,343 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 179 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:00,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 419 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 238 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2022-04-27 10:18:00,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-04-27 10:18:00,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2022-04-27 10:18:00,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:00,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 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-27 10:18:00,428 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 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-27 10:18:00,429 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 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-27 10:18:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:00,438 INFO L93 Difference]: Finished difference Result 223 states and 327 transitions. [2022-04-27 10:18:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2022-04-27 10:18:00,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:00,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:00,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 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 223 states. [2022-04-27 10:18:00,441 INFO L87 Difference]: Start difference. First operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 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 223 states. [2022-04-27 10:18:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:00,451 INFO L93 Difference]: Finished difference Result 223 states and 327 transitions. [2022-04-27 10:18:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2022-04-27 10:18:00,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:00,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:00,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:00,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 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-27 10:18:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2022-04-27 10:18:00,461 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2022-04-27 10:18:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:00,461 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2022-04-27 10:18:00,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2022-04-27 10:18:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 10:18:00,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:00,463 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:00,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:18:00,463 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:00,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:00,464 INFO L85 PathProgramCache]: Analyzing trace with hash 969835136, now seen corresponding path program 1 times [2022-04-27 10:18:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:00,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408968604] [2022-04-27 10:18:00,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:00,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:00,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:00,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {1316#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {1310#true} is VALID [2022-04-27 10:18:00,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {1310#true} assume true; {1310#true} is VALID [2022-04-27 10:18:00,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1310#true} {1310#true} #591#return; {1310#true} is VALID [2022-04-27 10:18:00,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {1310#true} call ULTIMATE.init(); {1316#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:00,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {1316#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {1310#true} is VALID [2022-04-27 10:18:00,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {1310#true} assume true; {1310#true} is VALID [2022-04-27 10:18:00,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1310#true} {1310#true} #591#return; {1310#true} is VALID [2022-04-27 10:18:00,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {1310#true} call #t~ret159 := main(); {1310#true} is VALID [2022-04-27 10:18:00,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {1310#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {1310#true} is VALID [2022-04-27 10:18:00,664 INFO L272 TraceCheckUtils]: 6: Hoare triple {1310#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {1310#true} is VALID [2022-04-27 10:18:00,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {1310#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1310#true} is VALID [2022-04-27 10:18:00,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {1310#true} is VALID [2022-04-27 10:18:00,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {1310#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {1310#true} is VALID [2022-04-27 10:18:00,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {1310#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1310#true} is VALID [2022-04-27 10:18:00,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {1310#true} assume !false; {1310#true} is VALID [2022-04-27 10:18:00,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {1310#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1310#true} is VALID [2022-04-27 10:18:00,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {1310#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1310#true} is VALID [2022-04-27 10:18:00,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {1310#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1310#true} is VALID [2022-04-27 10:18:00,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {1310#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1310#true} is VALID [2022-04-27 10:18:00,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {1310#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1310#true} is VALID [2022-04-27 10:18:00,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {1310#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1310#true} is VALID [2022-04-27 10:18:00,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {1310#true} assume 4368 == #t~mem48;havoc #t~mem48; {1310#true} is VALID [2022-04-27 10:18:00,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {1310#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {1310#true} is VALID [2022-04-27 10:18:00,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {1310#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !false; {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume 4432 == #t~mem56;havoc #t~mem56; {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,679 INFO L290 TraceCheckUtils]: 42: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {1315#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 10:18:00,679 INFO L290 TraceCheckUtils]: 43: Hoare triple {1315#(= ssl3_connect_~blastFlag~0 1)} assume 5 == ~blastFlag~0; {1311#false} is VALID [2022-04-27 10:18:00,680 INFO L290 TraceCheckUtils]: 44: Hoare triple {1311#false} assume !false; {1311#false} is VALID [2022-04-27 10:18:00,681 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-27 10:18:00,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:00,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408968604] [2022-04-27 10:18:00,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408968604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:00,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:00,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:18:00,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44687023] [2022-04-27 10:18:00,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:00,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 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 45 [2022-04-27 10:18:00,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:00,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:00,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:00,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:18:00,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:00,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:18:00,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:18:00,729 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:02,748 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-27 10:18:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:03,849 INFO L93 Difference]: Finished difference Result 432 states and 642 transitions. [2022-04-27 10:18:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:18:03,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 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 45 [2022-04-27 10:18:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-27 10:18:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-27 10:18:03,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 492 transitions. [2022-04-27 10:18:04,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:04,274 INFO L225 Difference]: With dead ends: 432 [2022-04-27 10:18:04,274 INFO L226 Difference]: Without dead ends: 325 [2022-04-27 10:18:04,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:18:04,276 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 126 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:04,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 476 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 10:18:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-04-27 10:18:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-04-27 10:18:04,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:04,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 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-27 10:18:04,288 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 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-27 10:18:04,288 INFO L87 Difference]: Start difference. First operand 325 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 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-27 10:18:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:04,298 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2022-04-27 10:18:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2022-04-27 10:18:04,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:04,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:04,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 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 325 states. [2022-04-27 10:18:04,301 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 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 325 states. [2022-04-27 10:18:04,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:04,311 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2022-04-27 10:18:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2022-04-27 10:18:04,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:04,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:04,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:04,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 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-27 10:18:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2022-04-27 10:18:04,324 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2022-04-27 10:18:04,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:04,324 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2022-04-27 10:18:04,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2022-04-27 10:18:04,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 10:18:04,326 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:04,326 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:04,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:18:04,326 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:04,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:04,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2112862728, now seen corresponding path program 1 times [2022-04-27 10:18:04,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:04,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982003023] [2022-04-27 10:18:04,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:04,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:04,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:04,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {2860#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {2853#true} is VALID [2022-04-27 10:18:04,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {2853#true} assume true; {2853#true} is VALID [2022-04-27 10:18:04,528 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2853#true} {2853#true} #591#return; {2853#true} is VALID [2022-04-27 10:18:04,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {2853#true} call ULTIMATE.init(); {2860#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:04,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {2860#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {2853#true} is VALID [2022-04-27 10:18:04,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {2853#true} assume true; {2853#true} is VALID [2022-04-27 10:18:04,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2853#true} {2853#true} #591#return; {2853#true} is VALID [2022-04-27 10:18:04,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {2853#true} call #t~ret159 := main(); {2853#true} is VALID [2022-04-27 10:18:04,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {2853#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {2853#true} is VALID [2022-04-27 10:18:04,537 INFO L272 TraceCheckUtils]: 6: Hoare triple {2853#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {2853#true} is VALID [2022-04-27 10:18:04,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {2853#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {2853#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {2853#true} is VALID [2022-04-27 10:18:04,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {2853#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {2853#true} is VALID [2022-04-27 10:18:04,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {2853#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2853#true} is VALID [2022-04-27 10:18:04,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {2853#true} assume !false; {2853#true} is VALID [2022-04-27 10:18:04,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {2853#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {2853#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {2853#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {2853#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {2853#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {2853#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {2853#true} assume 4368 == #t~mem48;havoc #t~mem48; {2853#true} is VALID [2022-04-27 10:18:04,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {2853#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {2853#true} is VALID [2022-04-27 10:18:04,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {2853#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2853#true} is VALID [2022-04-27 10:18:04,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {2853#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {2853#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {2853#true} is VALID [2022-04-27 10:18:04,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {2853#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {2853#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {2853#true} is VALID [2022-04-27 10:18:04,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {2853#true} ~skip~0 := 0; {2853#true} is VALID [2022-04-27 10:18:04,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {2853#true} assume !false; {2853#true} is VALID [2022-04-27 10:18:04,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {2853#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {2853#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {2853#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {2853#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {2853#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {2853#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {2853#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {2853#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {2853#true} assume 4384 == #t~mem50;havoc #t~mem50; {2853#true} is VALID [2022-04-27 10:18:04,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {2853#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {2853#true} is VALID [2022-04-27 10:18:04,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {2853#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {2853#true} is VALID [2022-04-27 10:18:04,542 INFO L290 TraceCheckUtils]: 38: Hoare triple {2853#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {2853#true} is VALID [2022-04-27 10:18:04,543 INFO L290 TraceCheckUtils]: 39: Hoare triple {2853#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,546 INFO L290 TraceCheckUtils]: 41: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,547 INFO L290 TraceCheckUtils]: 42: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,547 INFO L290 TraceCheckUtils]: 43: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,549 INFO L290 TraceCheckUtils]: 46: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,549 INFO L290 TraceCheckUtils]: 47: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,550 INFO L290 TraceCheckUtils]: 48: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,550 INFO L290 TraceCheckUtils]: 49: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,550 INFO L290 TraceCheckUtils]: 50: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,551 INFO L290 TraceCheckUtils]: 51: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,551 INFO L290 TraceCheckUtils]: 52: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,552 INFO L290 TraceCheckUtils]: 53: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,552 INFO L290 TraceCheckUtils]: 54: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,553 INFO L290 TraceCheckUtils]: 55: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,553 INFO L290 TraceCheckUtils]: 56: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,554 INFO L290 TraceCheckUtils]: 57: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:04,554 INFO L290 TraceCheckUtils]: 58: Hoare triple {2858#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2859#(= |ssl3_connect_#t~mem56| 4560)} is VALID [2022-04-27 10:18:04,555 INFO L290 TraceCheckUtils]: 59: Hoare triple {2859#(= |ssl3_connect_#t~mem56| 4560)} assume 4432 == #t~mem56;havoc #t~mem56; {2854#false} is VALID [2022-04-27 10:18:04,555 INFO L290 TraceCheckUtils]: 60: Hoare triple {2854#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {2854#false} is VALID [2022-04-27 10:18:04,555 INFO L290 TraceCheckUtils]: 61: Hoare triple {2854#false} assume 5 == ~blastFlag~0; {2854#false} is VALID [2022-04-27 10:18:04,555 INFO L290 TraceCheckUtils]: 62: Hoare triple {2854#false} assume !false; {2854#false} is VALID [2022-04-27 10:18:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:18:04,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:04,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982003023] [2022-04-27 10:18:04,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982003023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:04,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:04,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:04,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748368992] [2022-04-27 10:18:04,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:04,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 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-27 10:18:04,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:04,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:04,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:04,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:04,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:04,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:04,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:04,621 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:06,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:18:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:08,247 INFO L93 Difference]: Finished difference Result 825 states and 1216 transitions. [2022-04-27 10:18:08,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:08,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 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-27 10:18:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2022-04-27 10:18:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2022-04-27 10:18:08,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 481 transitions. [2022-04-27 10:18:08,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 481 edges. 481 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:08,613 INFO L225 Difference]: With dead ends: 825 [2022-04-27 10:18:08,613 INFO L226 Difference]: Without dead ends: 513 [2022-04-27 10:18:08,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:08,615 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 98 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:08,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 582 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 552 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 10:18:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-04-27 10:18:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2022-04-27 10:18:08,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:08,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 513 states. Second operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 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-27 10:18:08,629 INFO L74 IsIncluded]: Start isIncluded. First operand 513 states. Second operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 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-27 10:18:08,630 INFO L87 Difference]: Start difference. First operand 513 states. Second operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 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-27 10:18:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:08,649 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2022-04-27 10:18:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 755 transitions. [2022-04-27 10:18:08,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:08,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:08,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 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 513 states. [2022-04-27 10:18:08,652 INFO L87 Difference]: Start difference. First operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 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 513 states. [2022-04-27 10:18:08,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:08,670 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2022-04-27 10:18:08,670 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 755 transitions. [2022-04-27 10:18:08,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:08,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:08,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:08,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 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-27 10:18:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2022-04-27 10:18:08,683 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2022-04-27 10:18:08,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:08,683 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2022-04-27 10:18:08,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2022-04-27 10:18:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 10:18:08,684 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:08,685 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:08,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:18:08,685 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:08,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2048091062, now seen corresponding path program 1 times [2022-04-27 10:18:08,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:08,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108724745] [2022-04-27 10:18:08,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:08,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:08,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:08,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {5292#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {5285#true} is VALID [2022-04-27 10:18:08,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {5285#true} assume true; {5285#true} is VALID [2022-04-27 10:18:08,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5285#true} {5285#true} #591#return; {5285#true} is VALID [2022-04-27 10:18:08,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {5285#true} call ULTIMATE.init(); {5292#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:08,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {5292#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {5285#true} is VALID [2022-04-27 10:18:08,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {5285#true} assume true; {5285#true} is VALID [2022-04-27 10:18:08,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5285#true} {5285#true} #591#return; {5285#true} is VALID [2022-04-27 10:18:08,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {5285#true} call #t~ret159 := main(); {5285#true} is VALID [2022-04-27 10:18:08,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {5285#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {5285#true} is VALID [2022-04-27 10:18:08,924 INFO L272 TraceCheckUtils]: 6: Hoare triple {5285#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {5285#true} is VALID [2022-04-27 10:18:08,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {5285#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {5285#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {5285#true} is VALID [2022-04-27 10:18:08,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {5285#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {5285#true} is VALID [2022-04-27 10:18:08,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {5285#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5285#true} is VALID [2022-04-27 10:18:08,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {5285#true} assume !false; {5285#true} is VALID [2022-04-27 10:18:08,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {5285#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {5285#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {5285#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {5285#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {5285#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {5285#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {5285#true} assume 4368 == #t~mem48;havoc #t~mem48; {5285#true} is VALID [2022-04-27 10:18:08,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {5285#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {5285#true} is VALID [2022-04-27 10:18:08,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {5285#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {5285#true} is VALID [2022-04-27 10:18:08,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {5285#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {5285#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {5285#true} is VALID [2022-04-27 10:18:08,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {5285#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {5285#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {5285#true} is VALID [2022-04-27 10:18:08,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {5285#true} ~skip~0 := 0; {5285#true} is VALID [2022-04-27 10:18:08,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {5285#true} assume !false; {5285#true} is VALID [2022-04-27 10:18:08,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {5285#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {5285#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {5285#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {5285#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {5285#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {5285#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {5285#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {5285#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {5285#true} assume 4384 == #t~mem50;havoc #t~mem50; {5285#true} is VALID [2022-04-27 10:18:08,939 INFO L290 TraceCheckUtils]: 36: Hoare triple {5285#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {5285#true} is VALID [2022-04-27 10:18:08,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {5285#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {5285#true} is VALID [2022-04-27 10:18:08,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {5285#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {5285#true} is VALID [2022-04-27 10:18:08,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {5285#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,942 INFO L290 TraceCheckUtils]: 42: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,942 INFO L290 TraceCheckUtils]: 43: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,943 INFO L290 TraceCheckUtils]: 44: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,943 INFO L290 TraceCheckUtils]: 45: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,943 INFO L290 TraceCheckUtils]: 46: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,944 INFO L290 TraceCheckUtils]: 47: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,944 INFO L290 TraceCheckUtils]: 48: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,944 INFO L290 TraceCheckUtils]: 49: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,945 INFO L290 TraceCheckUtils]: 50: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,949 INFO L290 TraceCheckUtils]: 53: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,949 INFO L290 TraceCheckUtils]: 54: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,949 INFO L290 TraceCheckUtils]: 55: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,950 INFO L290 TraceCheckUtils]: 56: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,950 INFO L290 TraceCheckUtils]: 57: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:08,950 INFO L290 TraceCheckUtils]: 58: Hoare triple {5290#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5291#(not (= |ssl3_connect_#t~mem56| 4432))} is VALID [2022-04-27 10:18:08,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {5291#(not (= |ssl3_connect_#t~mem56| 4432))} assume 4432 == #t~mem56;havoc #t~mem56; {5286#false} is VALID [2022-04-27 10:18:08,952 INFO L290 TraceCheckUtils]: 60: Hoare triple {5286#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {5286#false} is VALID [2022-04-27 10:18:08,952 INFO L290 TraceCheckUtils]: 61: Hoare triple {5286#false} assume 5 == ~blastFlag~0; {5286#false} is VALID [2022-04-27 10:18:08,952 INFO L290 TraceCheckUtils]: 62: Hoare triple {5286#false} assume !false; {5286#false} is VALID [2022-04-27 10:18:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:18:08,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:08,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108724745] [2022-04-27 10:18:08,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108724745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:08,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:08,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:08,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116678694] [2022-04-27 10:18:08,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:08,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 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-27 10:18:08,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:08,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:09,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:09,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:09,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:09,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:09,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:09,003 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:11,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:18:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:12,116 INFO L93 Difference]: Finished difference Result 1012 states and 1518 transitions. [2022-04-27 10:18:12,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:12,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 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-27 10:18:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-27 10:18:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-27 10:18:12,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-27 10:18:12,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:12,491 INFO L225 Difference]: With dead ends: 1012 [2022-04-27 10:18:12,491 INFO L226 Difference]: Without dead ends: 650 [2022-04-27 10:18:12,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:12,493 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 108 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:12,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 285 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 10:18:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-04-27 10:18:12,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 397. [2022-04-27 10:18:12,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:12,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 650 states. Second operand has 397 states, 392 states have (on average 1.5255102040816326) internal successors, (598), 392 states have internal predecessors, (598), 3 states have call successors, (3), 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-27 10:18:12,505 INFO L74 IsIncluded]: Start isIncluded. First operand 650 states. Second operand has 397 states, 392 states have (on average 1.5255102040816326) internal successors, (598), 392 states have internal predecessors, (598), 3 states have call successors, (3), 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-27 10:18:12,506 INFO L87 Difference]: Start difference. First operand 650 states. Second operand has 397 states, 392 states have (on average 1.5255102040816326) internal successors, (598), 392 states have internal predecessors, (598), 3 states have call successors, (3), 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-27 10:18:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:12,528 INFO L93 Difference]: Finished difference Result 650 states and 970 transitions. [2022-04-27 10:18:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 970 transitions. [2022-04-27 10:18:12,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:12,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:12,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 397 states, 392 states have (on average 1.5255102040816326) internal successors, (598), 392 states have internal predecessors, (598), 3 states have call successors, (3), 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 650 states. [2022-04-27 10:18:12,531 INFO L87 Difference]: Start difference. First operand has 397 states, 392 states have (on average 1.5255102040816326) internal successors, (598), 392 states have internal predecessors, (598), 3 states have call successors, (3), 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 650 states. [2022-04-27 10:18:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:12,553 INFO L93 Difference]: Finished difference Result 650 states and 970 transitions. [2022-04-27 10:18:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 970 transitions. [2022-04-27 10:18:12,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:12,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:12,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:12,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 392 states have (on average 1.5255102040816326) internal successors, (598), 392 states have internal predecessors, (598), 3 states have call successors, (3), 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-27 10:18:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 602 transitions. [2022-04-27 10:18:12,566 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 602 transitions. Word has length 63 [2022-04-27 10:18:12,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:12,566 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 602 transitions. [2022-04-27 10:18:12,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 602 transitions. [2022-04-27 10:18:12,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 10:18:12,568 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:12,568 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-04-27 10:18:12,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:18:12,568 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:12,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:12,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1078652993, now seen corresponding path program 1 times [2022-04-27 10:18:12,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:12,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153006533] [2022-04-27 10:18:12,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:12,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:12,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:12,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {8228#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {8221#true} is VALID [2022-04-27 10:18:12,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {8221#true} assume true; {8221#true} is VALID [2022-04-27 10:18:12,778 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8221#true} {8221#true} #591#return; {8221#true} is VALID [2022-04-27 10:18:12,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {8221#true} call ULTIMATE.init(); {8228#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:12,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {8228#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {8221#true} is VALID [2022-04-27 10:18:12,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {8221#true} assume true; {8221#true} is VALID [2022-04-27 10:18:12,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8221#true} {8221#true} #591#return; {8221#true} is VALID [2022-04-27 10:18:12,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {8221#true} call #t~ret159 := main(); {8221#true} is VALID [2022-04-27 10:18:12,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {8221#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {8221#true} is VALID [2022-04-27 10:18:12,779 INFO L272 TraceCheckUtils]: 6: Hoare triple {8221#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {8221#true} is VALID [2022-04-27 10:18:12,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {8221#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {8221#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {8221#true} is VALID [2022-04-27 10:18:12,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {8221#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {8221#true} is VALID [2022-04-27 10:18:12,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {8221#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8221#true} is VALID [2022-04-27 10:18:12,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {8221#true} assume !false; {8221#true} is VALID [2022-04-27 10:18:12,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {8221#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {8221#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {8221#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {8221#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {8221#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {8221#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {8221#true} assume 4368 == #t~mem48;havoc #t~mem48; {8221#true} is VALID [2022-04-27 10:18:12,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {8221#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {8221#true} is VALID [2022-04-27 10:18:12,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {8221#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {8221#true} is VALID [2022-04-27 10:18:12,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {8221#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {8221#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {8221#true} is VALID [2022-04-27 10:18:12,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {8221#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {8221#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {8221#true} is VALID [2022-04-27 10:18:12,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {8221#true} ~skip~0 := 0; {8221#true} is VALID [2022-04-27 10:18:12,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {8221#true} assume !false; {8221#true} is VALID [2022-04-27 10:18:12,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {8221#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {8221#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {8221#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {8221#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {8221#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {8221#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {8221#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {8221#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {8221#true} assume 4384 == #t~mem50;havoc #t~mem50; {8221#true} is VALID [2022-04-27 10:18:12,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {8221#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {8221#true} is VALID [2022-04-27 10:18:12,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {8221#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {8221#true} is VALID [2022-04-27 10:18:12,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {8221#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {8221#true} is VALID [2022-04-27 10:18:12,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {8221#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,797 INFO L290 TraceCheckUtils]: 43: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,799 INFO L290 TraceCheckUtils]: 47: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,799 INFO L290 TraceCheckUtils]: 48: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,800 INFO L290 TraceCheckUtils]: 51: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,801 INFO L290 TraceCheckUtils]: 52: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,801 INFO L290 TraceCheckUtils]: 53: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,802 INFO L290 TraceCheckUtils]: 54: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,802 INFO L290 TraceCheckUtils]: 55: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,802 INFO L290 TraceCheckUtils]: 56: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:12,804 INFO L290 TraceCheckUtils]: 59: Hoare triple {8226#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8227#(not (= |ssl3_connect_#t~mem57| 4433))} is VALID [2022-04-27 10:18:12,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {8227#(not (= |ssl3_connect_#t~mem57| 4433))} assume 4433 == #t~mem57;havoc #t~mem57; {8222#false} is VALID [2022-04-27 10:18:12,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {8222#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {8222#false} is VALID [2022-04-27 10:18:12,805 INFO L290 TraceCheckUtils]: 62: Hoare triple {8222#false} assume 5 == ~blastFlag~0; {8222#false} is VALID [2022-04-27 10:18:12,805 INFO L290 TraceCheckUtils]: 63: Hoare triple {8222#false} assume !false; {8222#false} is VALID [2022-04-27 10:18:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:18:12,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:12,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153006533] [2022-04-27 10:18:12,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153006533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:12,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:12,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:12,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673533433] [2022-04-27 10:18:12,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:12,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-27 10:18:12,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:12,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:12,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:12,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:12,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:12,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:12,852 INFO L87 Difference]: Start difference. First operand 397 states and 602 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:14,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:18:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:15,968 INFO L93 Difference]: Finished difference Result 1056 states and 1598 transitions. [2022-04-27 10:18:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:15,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-27 10:18:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-27 10:18:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-27 10:18:15,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-27 10:18:16,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:16,365 INFO L225 Difference]: With dead ends: 1056 [2022-04-27 10:18:16,365 INFO L226 Difference]: Without dead ends: 672 [2022-04-27 10:18:16,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:16,367 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 108 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:16,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 284 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 10:18:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-04-27 10:18:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 472. [2022-04-27 10:18:16,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:16,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 672 states. Second operand has 472 states, 467 states have (on average 1.563169164882227) internal successors, (730), 467 states have internal predecessors, (730), 3 states have call successors, (3), 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-27 10:18:16,381 INFO L74 IsIncluded]: Start isIncluded. First operand 672 states. Second operand has 472 states, 467 states have (on average 1.563169164882227) internal successors, (730), 467 states have internal predecessors, (730), 3 states have call successors, (3), 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-27 10:18:16,382 INFO L87 Difference]: Start difference. First operand 672 states. Second operand has 472 states, 467 states have (on average 1.563169164882227) internal successors, (730), 467 states have internal predecessors, (730), 3 states have call successors, (3), 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-27 10:18:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:16,405 INFO L93 Difference]: Finished difference Result 672 states and 1010 transitions. [2022-04-27 10:18:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1010 transitions. [2022-04-27 10:18:16,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:16,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:16,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 472 states, 467 states have (on average 1.563169164882227) internal successors, (730), 467 states have internal predecessors, (730), 3 states have call successors, (3), 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 672 states. [2022-04-27 10:18:16,408 INFO L87 Difference]: Start difference. First operand has 472 states, 467 states have (on average 1.563169164882227) internal successors, (730), 467 states have internal predecessors, (730), 3 states have call successors, (3), 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 672 states. [2022-04-27 10:18:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:16,431 INFO L93 Difference]: Finished difference Result 672 states and 1010 transitions. [2022-04-27 10:18:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1010 transitions. [2022-04-27 10:18:16,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:16,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:16,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:16,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 467 states have (on average 1.563169164882227) internal successors, (730), 467 states have internal predecessors, (730), 3 states have call successors, (3), 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-27 10:18:16,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 734 transitions. [2022-04-27 10:18:16,447 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 734 transitions. Word has length 64 [2022-04-27 10:18:16,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:16,447 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 734 transitions. [2022-04-27 10:18:16,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 734 transitions. [2022-04-27 10:18:16,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 10:18:16,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:16,449 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-04-27 10:18:16,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:18:16,449 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:16,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:16,449 INFO L85 PathProgramCache]: Analyzing trace with hash 917238579, now seen corresponding path program 1 times [2022-04-27 10:18:16,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:16,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461923050] [2022-04-27 10:18:16,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:16,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {11332#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {11325#true} is VALID [2022-04-27 10:18:16,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {11325#true} assume true; {11325#true} is VALID [2022-04-27 10:18:16,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11325#true} {11325#true} #591#return; {11325#true} is VALID [2022-04-27 10:18:16,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {11325#true} call ULTIMATE.init(); {11332#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:16,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {11332#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {11325#true} is VALID [2022-04-27 10:18:16,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {11325#true} assume true; {11325#true} is VALID [2022-04-27 10:18:16,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11325#true} {11325#true} #591#return; {11325#true} is VALID [2022-04-27 10:18:16,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {11325#true} call #t~ret159 := main(); {11325#true} is VALID [2022-04-27 10:18:16,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {11325#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {11325#true} is VALID [2022-04-27 10:18:16,589 INFO L272 TraceCheckUtils]: 6: Hoare triple {11325#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {11325#true} is VALID [2022-04-27 10:18:16,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {11325#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {11325#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {11325#true} is VALID [2022-04-27 10:18:16,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {11325#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {11325#true} is VALID [2022-04-27 10:18:16,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {11325#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11325#true} is VALID [2022-04-27 10:18:16,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {11325#true} assume !false; {11325#true} is VALID [2022-04-27 10:18:16,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {11325#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {11325#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {11325#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {11325#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {11325#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {11325#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {11325#true} assume 4368 == #t~mem48;havoc #t~mem48; {11325#true} is VALID [2022-04-27 10:18:16,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {11325#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {11325#true} is VALID [2022-04-27 10:18:16,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {11325#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11325#true} is VALID [2022-04-27 10:18:16,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {11325#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {11325#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {11325#true} is VALID [2022-04-27 10:18:16,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {11325#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {11325#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11325#true} is VALID [2022-04-27 10:18:16,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {11325#true} ~skip~0 := 0; {11325#true} is VALID [2022-04-27 10:18:16,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {11325#true} assume !false; {11325#true} is VALID [2022-04-27 10:18:16,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {11325#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {11325#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {11325#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {11325#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {11325#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {11325#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {11325#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {11325#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {11325#true} assume 4384 == #t~mem50;havoc #t~mem50; {11325#true} is VALID [2022-04-27 10:18:16,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {11325#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {11325#true} is VALID [2022-04-27 10:18:16,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {11325#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {11325#true} is VALID [2022-04-27 10:18:16,594 INFO L290 TraceCheckUtils]: 38: Hoare triple {11325#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {11325#true} is VALID [2022-04-27 10:18:16,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {11325#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,596 INFO L290 TraceCheckUtils]: 40: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,599 INFO L290 TraceCheckUtils]: 49: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,600 INFO L290 TraceCheckUtils]: 50: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,600 INFO L290 TraceCheckUtils]: 51: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,600 INFO L290 TraceCheckUtils]: 52: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,601 INFO L290 TraceCheckUtils]: 53: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,606 INFO L290 TraceCheckUtils]: 54: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,607 INFO L290 TraceCheckUtils]: 55: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,608 INFO L290 TraceCheckUtils]: 57: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,608 INFO L290 TraceCheckUtils]: 58: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,608 INFO L290 TraceCheckUtils]: 59: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:16,609 INFO L290 TraceCheckUtils]: 60: Hoare triple {11330#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11331#(= |ssl3_connect_#t~mem58| 4560)} is VALID [2022-04-27 10:18:16,609 INFO L290 TraceCheckUtils]: 61: Hoare triple {11331#(= |ssl3_connect_#t~mem58| 4560)} assume 4448 == #t~mem58;havoc #t~mem58; {11326#false} is VALID [2022-04-27 10:18:16,609 INFO L290 TraceCheckUtils]: 62: Hoare triple {11326#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {11326#false} is VALID [2022-04-27 10:18:16,609 INFO L290 TraceCheckUtils]: 63: Hoare triple {11326#false} assume 4 == ~blastFlag~0; {11326#false} is VALID [2022-04-27 10:18:16,609 INFO L290 TraceCheckUtils]: 64: Hoare triple {11326#false} assume !false; {11326#false} is VALID [2022-04-27 10:18:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:18:16,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:16,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461923050] [2022-04-27 10:18:16,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461923050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:16,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:16,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:16,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216553737] [2022-04-27 10:18:16,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:16,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-27 10:18:16,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:16,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:16,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:16,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:16,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:16,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:16,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:16,672 INFO L87 Difference]: Start difference. First operand 472 states and 734 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:18,697 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-27 10:18:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:20,241 INFO L93 Difference]: Finished difference Result 1113 states and 1721 transitions. [2022-04-27 10:18:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:20,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-27 10:18:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-27 10:18:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-27 10:18:20,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-27 10:18:20,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:20,664 INFO L225 Difference]: With dead ends: 1113 [2022-04-27 10:18:20,664 INFO L226 Difference]: Without dead ends: 654 [2022-04-27 10:18:20,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:20,665 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 91 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:20,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 574 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 544 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 10:18:20,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-04-27 10:18:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 526. [2022-04-27 10:18:20,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:20,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 654 states. Second operand has 526 states, 521 states have (on average 1.5738963531669865) internal successors, (820), 521 states have internal predecessors, (820), 3 states have call successors, (3), 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-27 10:18:20,679 INFO L74 IsIncluded]: Start isIncluded. First operand 654 states. Second operand has 526 states, 521 states have (on average 1.5738963531669865) internal successors, (820), 521 states have internal predecessors, (820), 3 states have call successors, (3), 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-27 10:18:20,680 INFO L87 Difference]: Start difference. First operand 654 states. Second operand has 526 states, 521 states have (on average 1.5738963531669865) internal successors, (820), 521 states have internal predecessors, (820), 3 states have call successors, (3), 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-27 10:18:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:20,701 INFO L93 Difference]: Finished difference Result 654 states and 1002 transitions. [2022-04-27 10:18:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1002 transitions. [2022-04-27 10:18:20,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:20,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:20,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 526 states, 521 states have (on average 1.5738963531669865) internal successors, (820), 521 states have internal predecessors, (820), 3 states have call successors, (3), 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 654 states. [2022-04-27 10:18:20,707 INFO L87 Difference]: Start difference. First operand has 526 states, 521 states have (on average 1.5738963531669865) internal successors, (820), 521 states have internal predecessors, (820), 3 states have call successors, (3), 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 654 states. [2022-04-27 10:18:20,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:20,729 INFO L93 Difference]: Finished difference Result 654 states and 1002 transitions. [2022-04-27 10:18:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1002 transitions. [2022-04-27 10:18:20,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:20,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:20,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:20,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 521 states have (on average 1.5738963531669865) internal successors, (820), 521 states have internal predecessors, (820), 3 states have call successors, (3), 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-27 10:18:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 824 transitions. [2022-04-27 10:18:20,748 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 824 transitions. Word has length 65 [2022-04-27 10:18:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:20,749 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 824 transitions. [2022-04-27 10:18:20,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 824 transitions. [2022-04-27 10:18:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 10:18:20,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:20,750 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-04-27 10:18:20,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 10:18:20,750 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:20,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash 979278193, now seen corresponding path program 1 times [2022-04-27 10:18:20,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:20,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373378758] [2022-04-27 10:18:20,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:20,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:20,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {14501#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {14494#true} is VALID [2022-04-27 10:18:20,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {14494#true} assume true; {14494#true} is VALID [2022-04-27 10:18:20,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14494#true} {14494#true} #591#return; {14494#true} is VALID [2022-04-27 10:18:20,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {14494#true} call ULTIMATE.init(); {14501#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:20,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {14501#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {14494#true} is VALID [2022-04-27 10:18:20,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {14494#true} assume true; {14494#true} is VALID [2022-04-27 10:18:20,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14494#true} {14494#true} #591#return; {14494#true} is VALID [2022-04-27 10:18:20,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {14494#true} call #t~ret159 := main(); {14494#true} is VALID [2022-04-27 10:18:20,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {14494#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {14494#true} is VALID [2022-04-27 10:18:20,929 INFO L272 TraceCheckUtils]: 6: Hoare triple {14494#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {14494#true} is VALID [2022-04-27 10:18:20,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {14494#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {14494#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {14494#true} is VALID [2022-04-27 10:18:20,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {14494#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {14494#true} is VALID [2022-04-27 10:18:20,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {14494#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14494#true} is VALID [2022-04-27 10:18:20,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {14494#true} assume !false; {14494#true} is VALID [2022-04-27 10:18:20,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {14494#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {14494#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {14494#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {14494#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {14494#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {14494#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {14494#true} assume 4368 == #t~mem48;havoc #t~mem48; {14494#true} is VALID [2022-04-27 10:18:20,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {14494#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {14494#true} is VALID [2022-04-27 10:18:20,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {14494#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14494#true} is VALID [2022-04-27 10:18:20,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {14494#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {14494#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {14494#true} is VALID [2022-04-27 10:18:20,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {14494#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {14494#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {14494#true} is VALID [2022-04-27 10:18:20,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {14494#true} ~skip~0 := 0; {14494#true} is VALID [2022-04-27 10:18:20,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {14494#true} assume !false; {14494#true} is VALID [2022-04-27 10:18:20,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {14494#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {14494#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {14494#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {14494#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {14494#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {14494#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {14494#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {14494#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {14494#true} assume 4384 == #t~mem50;havoc #t~mem50; {14494#true} is VALID [2022-04-27 10:18:20,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {14494#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {14494#true} is VALID [2022-04-27 10:18:20,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {14494#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {14494#true} is VALID [2022-04-27 10:18:20,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {14494#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {14494#true} is VALID [2022-04-27 10:18:20,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {14494#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,940 INFO L290 TraceCheckUtils]: 45: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,940 INFO L290 TraceCheckUtils]: 46: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,941 INFO L290 TraceCheckUtils]: 48: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,942 INFO L290 TraceCheckUtils]: 51: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,943 INFO L290 TraceCheckUtils]: 53: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,943 INFO L290 TraceCheckUtils]: 55: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,944 INFO L290 TraceCheckUtils]: 56: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,944 INFO L290 TraceCheckUtils]: 57: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,945 INFO L290 TraceCheckUtils]: 58: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,945 INFO L290 TraceCheckUtils]: 59: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:20,945 INFO L290 TraceCheckUtils]: 60: Hoare triple {14499#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14500#(not (= |ssl3_connect_#t~mem58| 4448))} is VALID [2022-04-27 10:18:20,946 INFO L290 TraceCheckUtils]: 61: Hoare triple {14500#(not (= |ssl3_connect_#t~mem58| 4448))} assume 4448 == #t~mem58;havoc #t~mem58; {14495#false} is VALID [2022-04-27 10:18:20,946 INFO L290 TraceCheckUtils]: 62: Hoare triple {14495#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {14495#false} is VALID [2022-04-27 10:18:20,946 INFO L290 TraceCheckUtils]: 63: Hoare triple {14495#false} assume 4 == ~blastFlag~0; {14495#false} is VALID [2022-04-27 10:18:20,947 INFO L290 TraceCheckUtils]: 64: Hoare triple {14495#false} assume !false; {14495#false} is VALID [2022-04-27 10:18:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:18:20,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:20,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373378758] [2022-04-27 10:18:20,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373378758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:20,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:20,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:20,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365503927] [2022-04-27 10:18:20,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:20,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-27 10:18:20,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:20,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:20,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:20,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:20,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:20,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:20,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:20,996 INFO L87 Difference]: Start difference. First operand 526 states and 824 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:23,024 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-27 10:18:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:24,166 INFO L93 Difference]: Finished difference Result 1314 states and 2036 transitions. [2022-04-27 10:18:24,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:24,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-27 10:18:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-27 10:18:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-27 10:18:24,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-27 10:18:24,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:24,616 INFO L225 Difference]: With dead ends: 1314 [2022-04-27 10:18:24,616 INFO L226 Difference]: Without dead ends: 801 [2022-04-27 10:18:24,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:24,618 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 106 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:24,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 284 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 10:18:24,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-04-27 10:18:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 550. [2022-04-27 10:18:24,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:24,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 801 states. Second operand has 550 states, 545 states have (on average 1.581651376146789) internal successors, (862), 545 states have internal predecessors, (862), 3 states have call successors, (3), 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-27 10:18:24,634 INFO L74 IsIncluded]: Start isIncluded. First operand 801 states. Second operand has 550 states, 545 states have (on average 1.581651376146789) internal successors, (862), 545 states have internal predecessors, (862), 3 states have call successors, (3), 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-27 10:18:24,635 INFO L87 Difference]: Start difference. First operand 801 states. Second operand has 550 states, 545 states have (on average 1.581651376146789) internal successors, (862), 545 states have internal predecessors, (862), 3 states have call successors, (3), 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-27 10:18:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:24,671 INFO L93 Difference]: Finished difference Result 801 states and 1226 transitions. [2022-04-27 10:18:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1226 transitions. [2022-04-27 10:18:24,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:24,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:24,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 550 states, 545 states have (on average 1.581651376146789) internal successors, (862), 545 states have internal predecessors, (862), 3 states have call successors, (3), 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 801 states. [2022-04-27 10:18:24,675 INFO L87 Difference]: Start difference. First operand has 550 states, 545 states have (on average 1.581651376146789) internal successors, (862), 545 states have internal predecessors, (862), 3 states have call successors, (3), 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 801 states. [2022-04-27 10:18:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:24,709 INFO L93 Difference]: Finished difference Result 801 states and 1226 transitions. [2022-04-27 10:18:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1226 transitions. [2022-04-27 10:18:24,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:24,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:24,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:24,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.581651376146789) internal successors, (862), 545 states have internal predecessors, (862), 3 states have call successors, (3), 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-27 10:18:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 866 transitions. [2022-04-27 10:18:24,729 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 866 transitions. Word has length 65 [2022-04-27 10:18:24,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:24,729 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 866 transitions. [2022-04-27 10:18:24,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 866 transitions. [2022-04-27 10:18:24,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 10:18:24,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:24,730 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:24,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 10:18:24,731 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:24,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:24,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1634852198, now seen corresponding path program 1 times [2022-04-27 10:18:24,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:24,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273653544] [2022-04-27 10:18:24,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:24,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:24,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:24,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {18212#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {18205#true} is VALID [2022-04-27 10:18:24,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {18205#true} assume true; {18205#true} is VALID [2022-04-27 10:18:24,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18205#true} {18205#true} #591#return; {18205#true} is VALID [2022-04-27 10:18:24,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {18205#true} call ULTIMATE.init(); {18212#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:24,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {18212#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {18205#true} is VALID [2022-04-27 10:18:24,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {18205#true} assume true; {18205#true} is VALID [2022-04-27 10:18:24,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18205#true} {18205#true} #591#return; {18205#true} is VALID [2022-04-27 10:18:24,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {18205#true} call #t~ret159 := main(); {18205#true} is VALID [2022-04-27 10:18:24,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {18205#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {18205#true} is VALID [2022-04-27 10:18:24,886 INFO L272 TraceCheckUtils]: 6: Hoare triple {18205#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {18205#true} is VALID [2022-04-27 10:18:24,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {18205#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {18205#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {18205#true} is VALID [2022-04-27 10:18:24,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {18205#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {18205#true} is VALID [2022-04-27 10:18:24,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {18205#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18205#true} is VALID [2022-04-27 10:18:24,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {18205#true} assume !false; {18205#true} is VALID [2022-04-27 10:18:24,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {18205#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {18205#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {18205#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {18205#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {18205#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {18205#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {18205#true} assume 4368 == #t~mem48;havoc #t~mem48; {18205#true} is VALID [2022-04-27 10:18:24,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {18205#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {18205#true} is VALID [2022-04-27 10:18:24,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {18205#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18205#true} is VALID [2022-04-27 10:18:24,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {18205#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {18205#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {18205#true} is VALID [2022-04-27 10:18:24,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {18205#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {18205#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18205#true} is VALID [2022-04-27 10:18:24,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {18205#true} ~skip~0 := 0; {18205#true} is VALID [2022-04-27 10:18:24,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {18205#true} assume !false; {18205#true} is VALID [2022-04-27 10:18:24,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {18205#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {18205#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {18205#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {18205#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {18205#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {18205#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {18205#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {18205#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {18205#true} assume 4384 == #t~mem50;havoc #t~mem50; {18205#true} is VALID [2022-04-27 10:18:24,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {18205#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {18205#true} is VALID [2022-04-27 10:18:24,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {18205#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {18205#true} is VALID [2022-04-27 10:18:24,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {18205#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {18205#true} is VALID [2022-04-27 10:18:24,889 INFO L290 TraceCheckUtils]: 39: Hoare triple {18205#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,889 INFO L290 TraceCheckUtils]: 40: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,890 INFO L290 TraceCheckUtils]: 42: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,891 INFO L290 TraceCheckUtils]: 43: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,891 INFO L290 TraceCheckUtils]: 44: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,891 INFO L290 TraceCheckUtils]: 45: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,894 INFO L290 TraceCheckUtils]: 51: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,894 INFO L290 TraceCheckUtils]: 52: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,895 INFO L290 TraceCheckUtils]: 54: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,895 INFO L290 TraceCheckUtils]: 55: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,895 INFO L290 TraceCheckUtils]: 56: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,896 INFO L290 TraceCheckUtils]: 57: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,896 INFO L290 TraceCheckUtils]: 58: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,897 INFO L290 TraceCheckUtils]: 59: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,897 INFO L290 TraceCheckUtils]: 60: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:24,897 INFO L290 TraceCheckUtils]: 61: Hoare triple {18210#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18211#(= |ssl3_connect_#t~mem59| 4560)} is VALID [2022-04-27 10:18:24,898 INFO L290 TraceCheckUtils]: 62: Hoare triple {18211#(= |ssl3_connect_#t~mem59| 4560)} assume 4449 == #t~mem59;havoc #t~mem59; {18206#false} is VALID [2022-04-27 10:18:24,898 INFO L290 TraceCheckUtils]: 63: Hoare triple {18206#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {18206#false} is VALID [2022-04-27 10:18:24,898 INFO L290 TraceCheckUtils]: 64: Hoare triple {18206#false} assume 4 == ~blastFlag~0; {18206#false} is VALID [2022-04-27 10:18:24,898 INFO L290 TraceCheckUtils]: 65: Hoare triple {18206#false} assume !false; {18206#false} is VALID [2022-04-27 10:18:24,898 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:18:24,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:24,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273653544] [2022-04-27 10:18:24,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273653544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:24,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:24,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:24,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539319197] [2022-04-27 10:18:24,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:24,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-27 10:18:24,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:24,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:24,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:24,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:24,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:24,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:24,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:24,955 INFO L87 Difference]: Start difference. First operand 550 states and 866 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:26,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:18:28,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:28,357 INFO L93 Difference]: Finished difference Result 1259 states and 1971 transitions. [2022-04-27 10:18:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:28,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-27 10:18:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:28,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-04-27 10:18:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:28,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-04-27 10:18:28,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 467 transitions. [2022-04-27 10:18:28,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:28,775 INFO L225 Difference]: With dead ends: 1259 [2022-04-27 10:18:28,775 INFO L226 Difference]: Without dead ends: 722 [2022-04-27 10:18:28,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:28,776 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 84 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:28,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 564 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 10:18:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-04-27 10:18:28,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 606. [2022-04-27 10:18:28,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:28,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 722 states. Second operand has 606 states, 601 states have (on average 1.5873544093178036) internal successors, (954), 601 states have internal predecessors, (954), 3 states have call successors, (3), 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-27 10:18:28,797 INFO L74 IsIncluded]: Start isIncluded. First operand 722 states. Second operand has 606 states, 601 states have (on average 1.5873544093178036) internal successors, (954), 601 states have internal predecessors, (954), 3 states have call successors, (3), 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-27 10:18:28,799 INFO L87 Difference]: Start difference. First operand 722 states. Second operand has 606 states, 601 states have (on average 1.5873544093178036) internal successors, (954), 601 states have internal predecessors, (954), 3 states have call successors, (3), 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-27 10:18:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:28,824 INFO L93 Difference]: Finished difference Result 722 states and 1120 transitions. [2022-04-27 10:18:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1120 transitions. [2022-04-27 10:18:28,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:28,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:28,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 601 states have (on average 1.5873544093178036) internal successors, (954), 601 states have internal predecessors, (954), 3 states have call successors, (3), 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 722 states. [2022-04-27 10:18:28,843 INFO L87 Difference]: Start difference. First operand has 606 states, 601 states have (on average 1.5873544093178036) internal successors, (954), 601 states have internal predecessors, (954), 3 states have call successors, (3), 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 722 states. [2022-04-27 10:18:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:28,869 INFO L93 Difference]: Finished difference Result 722 states and 1120 transitions. [2022-04-27 10:18:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1120 transitions. [2022-04-27 10:18:28,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:28,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:28,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:28,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 601 states have (on average 1.5873544093178036) internal successors, (954), 601 states have internal predecessors, (954), 3 states have call successors, (3), 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-27 10:18:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 958 transitions. [2022-04-27 10:18:28,893 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 958 transitions. Word has length 66 [2022-04-27 10:18:28,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:28,893 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 958 transitions. [2022-04-27 10:18:28,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 958 transitions. [2022-04-27 10:18:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 10:18:28,895 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:28,895 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:28,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 10:18:28,895 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:28,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:28,896 INFO L85 PathProgramCache]: Analyzing trace with hash 288375836, now seen corresponding path program 1 times [2022-04-27 10:18:28,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:28,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154382305] [2022-04-27 10:18:28,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:28,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:29,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:29,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {21749#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {21742#true} is VALID [2022-04-27 10:18:29,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {21742#true} assume true; {21742#true} is VALID [2022-04-27 10:18:29,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21742#true} {21742#true} #591#return; {21742#true} is VALID [2022-04-27 10:18:29,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {21742#true} call ULTIMATE.init(); {21749#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:29,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {21749#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {21742#true} is VALID [2022-04-27 10:18:29,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {21742#true} assume true; {21742#true} is VALID [2022-04-27 10:18:29,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21742#true} {21742#true} #591#return; {21742#true} is VALID [2022-04-27 10:18:29,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {21742#true} call #t~ret159 := main(); {21742#true} is VALID [2022-04-27 10:18:29,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {21742#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {21742#true} is VALID [2022-04-27 10:18:29,061 INFO L272 TraceCheckUtils]: 6: Hoare triple {21742#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {21742#true} is VALID [2022-04-27 10:18:29,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {21742#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {21742#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {21742#true} is VALID [2022-04-27 10:18:29,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {21742#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {21742#true} is VALID [2022-04-27 10:18:29,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {21742#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21742#true} is VALID [2022-04-27 10:18:29,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {21742#true} assume !false; {21742#true} is VALID [2022-04-27 10:18:29,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {21742#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {21742#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {21742#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {21742#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {21742#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {21742#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {21742#true} assume 4368 == #t~mem48;havoc #t~mem48; {21742#true} is VALID [2022-04-27 10:18:29,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {21742#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {21742#true} is VALID [2022-04-27 10:18:29,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {21742#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21742#true} is VALID [2022-04-27 10:18:29,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {21742#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {21742#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {21742#true} is VALID [2022-04-27 10:18:29,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {21742#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {21742#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21742#true} is VALID [2022-04-27 10:18:29,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {21742#true} ~skip~0 := 0; {21742#true} is VALID [2022-04-27 10:18:29,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {21742#true} assume !false; {21742#true} is VALID [2022-04-27 10:18:29,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {21742#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {21742#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {21742#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {21742#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {21742#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {21742#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {21742#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {21742#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {21742#true} assume 4384 == #t~mem50;havoc #t~mem50; {21742#true} is VALID [2022-04-27 10:18:29,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {21742#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {21742#true} is VALID [2022-04-27 10:18:29,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {21742#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21742#true} is VALID [2022-04-27 10:18:29,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {21742#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {21742#true} is VALID [2022-04-27 10:18:29,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {21742#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,065 INFO L290 TraceCheckUtils]: 40: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,065 INFO L290 TraceCheckUtils]: 41: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,066 INFO L290 TraceCheckUtils]: 42: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,066 INFO L290 TraceCheckUtils]: 43: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,067 INFO L290 TraceCheckUtils]: 45: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,067 INFO L290 TraceCheckUtils]: 46: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,067 INFO L290 TraceCheckUtils]: 47: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,068 INFO L290 TraceCheckUtils]: 51: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,069 INFO L290 TraceCheckUtils]: 52: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,069 INFO L290 TraceCheckUtils]: 53: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,069 INFO L290 TraceCheckUtils]: 54: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,070 INFO L290 TraceCheckUtils]: 55: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,070 INFO L290 TraceCheckUtils]: 56: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,070 INFO L290 TraceCheckUtils]: 57: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,071 INFO L290 TraceCheckUtils]: 58: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,071 INFO L290 TraceCheckUtils]: 59: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,071 INFO L290 TraceCheckUtils]: 60: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:29,072 INFO L290 TraceCheckUtils]: 61: Hoare triple {21747#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21748#(not (= 4449 |ssl3_connect_#t~mem59|))} is VALID [2022-04-27 10:18:29,072 INFO L290 TraceCheckUtils]: 62: Hoare triple {21748#(not (= 4449 |ssl3_connect_#t~mem59|))} assume 4449 == #t~mem59;havoc #t~mem59; {21743#false} is VALID [2022-04-27 10:18:29,072 INFO L290 TraceCheckUtils]: 63: Hoare triple {21743#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {21743#false} is VALID [2022-04-27 10:18:29,072 INFO L290 TraceCheckUtils]: 64: Hoare triple {21743#false} assume 4 == ~blastFlag~0; {21743#false} is VALID [2022-04-27 10:18:29,072 INFO L290 TraceCheckUtils]: 65: Hoare triple {21743#false} assume !false; {21743#false} is VALID [2022-04-27 10:18:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:18:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:29,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154382305] [2022-04-27 10:18:29,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154382305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:29,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:29,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:29,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713362690] [2022-04-27 10:18:29,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:29,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-27 10:18:29,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:29,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:29,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:29,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:29,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:29,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:29,133 INFO L87 Difference]: Start difference. First operand 606 states and 958 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:31,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:18:32,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:32,149 INFO L93 Difference]: Finished difference Result 1399 states and 2175 transitions. [2022-04-27 10:18:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:32,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-27 10:18:32,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-27 10:18:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-27 10:18:32,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-27 10:18:32,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:32,523 INFO L225 Difference]: With dead ends: 1399 [2022-04-27 10:18:32,523 INFO L226 Difference]: Without dead ends: 806 [2022-04-27 10:18:32,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:32,525 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 105 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:32,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 298 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 10:18:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-04-27 10:18:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 556. [2022-04-27 10:18:32,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:32,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 806 states. Second operand has 556 states, 551 states have (on average 1.5807622504537204) internal successors, (871), 551 states have internal predecessors, (871), 3 states have call successors, (3), 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-27 10:18:32,541 INFO L74 IsIncluded]: Start isIncluded. First operand 806 states. Second operand has 556 states, 551 states have (on average 1.5807622504537204) internal successors, (871), 551 states have internal predecessors, (871), 3 states have call successors, (3), 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-27 10:18:32,541 INFO L87 Difference]: Start difference. First operand 806 states. Second operand has 556 states, 551 states have (on average 1.5807622504537204) internal successors, (871), 551 states have internal predecessors, (871), 3 states have call successors, (3), 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-27 10:18:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:32,573 INFO L93 Difference]: Finished difference Result 806 states and 1231 transitions. [2022-04-27 10:18:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1231 transitions. [2022-04-27 10:18:32,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:32,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:32,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 556 states, 551 states have (on average 1.5807622504537204) internal successors, (871), 551 states have internal predecessors, (871), 3 states have call successors, (3), 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 806 states. [2022-04-27 10:18:32,576 INFO L87 Difference]: Start difference. First operand has 556 states, 551 states have (on average 1.5807622504537204) internal successors, (871), 551 states have internal predecessors, (871), 3 states have call successors, (3), 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 806 states. [2022-04-27 10:18:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:32,599 INFO L93 Difference]: Finished difference Result 806 states and 1231 transitions. [2022-04-27 10:18:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1231 transitions. [2022-04-27 10:18:32,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:32,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:32,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:32,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:32,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.5807622504537204) internal successors, (871), 551 states have internal predecessors, (871), 3 states have call successors, (3), 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-27 10:18:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 875 transitions. [2022-04-27 10:18:32,617 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 875 transitions. Word has length 66 [2022-04-27 10:18:32,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:32,618 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 875 transitions. [2022-04-27 10:18:32,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 875 transitions. [2022-04-27 10:18:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 10:18:32,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:32,619 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:32,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 10:18:32,619 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1163380997, now seen corresponding path program 1 times [2022-04-27 10:18:32,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:32,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345225055] [2022-04-27 10:18:32,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:32,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:32,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:32,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {25564#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {25557#true} is VALID [2022-04-27 10:18:32,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {25557#true} assume true; {25557#true} is VALID [2022-04-27 10:18:32,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25557#true} {25557#true} #591#return; {25557#true} is VALID [2022-04-27 10:18:32,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {25557#true} call ULTIMATE.init(); {25564#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:32,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {25564#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {25557#true} is VALID [2022-04-27 10:18:32,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {25557#true} assume true; {25557#true} is VALID [2022-04-27 10:18:32,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25557#true} {25557#true} #591#return; {25557#true} is VALID [2022-04-27 10:18:32,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {25557#true} call #t~ret159 := main(); {25557#true} is VALID [2022-04-27 10:18:32,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {25557#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {25557#true} is VALID [2022-04-27 10:18:32,764 INFO L272 TraceCheckUtils]: 6: Hoare triple {25557#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {25557#true} is VALID [2022-04-27 10:18:32,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {25557#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {25557#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {25557#true} is VALID [2022-04-27 10:18:32,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {25557#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {25557#true} is VALID [2022-04-27 10:18:32,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {25557#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25557#true} is VALID [2022-04-27 10:18:32,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {25557#true} assume !false; {25557#true} is VALID [2022-04-27 10:18:32,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {25557#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {25557#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {25557#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {25557#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {25557#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {25557#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {25557#true} assume 4368 == #t~mem48;havoc #t~mem48; {25557#true} is VALID [2022-04-27 10:18:32,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {25557#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {25557#true} is VALID [2022-04-27 10:18:32,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {25557#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25557#true} is VALID [2022-04-27 10:18:32,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {25557#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {25557#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {25557#true} is VALID [2022-04-27 10:18:32,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {25557#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {25557#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25557#true} is VALID [2022-04-27 10:18:32,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {25557#true} ~skip~0 := 0; {25557#true} is VALID [2022-04-27 10:18:32,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {25557#true} assume !false; {25557#true} is VALID [2022-04-27 10:18:32,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {25557#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {25557#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {25557#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {25557#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {25557#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {25557#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {25557#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {25557#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {25557#true} assume 4384 == #t~mem50;havoc #t~mem50; {25557#true} is VALID [2022-04-27 10:18:32,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {25557#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {25557#true} is VALID [2022-04-27 10:18:32,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {25557#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25557#true} is VALID [2022-04-27 10:18:32,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {25557#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {25557#true} is VALID [2022-04-27 10:18:32,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {25557#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,771 INFO L290 TraceCheckUtils]: 47: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,772 INFO L290 TraceCheckUtils]: 50: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,772 INFO L290 TraceCheckUtils]: 51: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,773 INFO L290 TraceCheckUtils]: 54: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,773 INFO L290 TraceCheckUtils]: 55: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:32,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {25562#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25563#(= |ssl3_connect_#t~mem54| 4560)} is VALID [2022-04-27 10:18:32,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {25563#(= |ssl3_connect_#t~mem54| 4560)} assume 4416 == #t~mem54;havoc #t~mem54; {25558#false} is VALID [2022-04-27 10:18:32,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {25558#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {25558#false} is VALID [2022-04-27 10:18:32,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {25558#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {25558#false} is VALID [2022-04-27 10:18:32,774 INFO L290 TraceCheckUtils]: 60: Hoare triple {25558#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {25558#false} is VALID [2022-04-27 10:18:32,775 INFO L290 TraceCheckUtils]: 61: Hoare triple {25558#false} assume !(0 == ~tmp___6~0); {25558#false} is VALID [2022-04-27 10:18:32,775 INFO L290 TraceCheckUtils]: 62: Hoare triple {25558#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,775 INFO L290 TraceCheckUtils]: 63: Hoare triple {25558#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25558#false} is VALID [2022-04-27 10:18:32,775 INFO L290 TraceCheckUtils]: 64: Hoare triple {25558#false} ~skip~0 := 0; {25558#false} is VALID [2022-04-27 10:18:32,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {25558#false} assume !false; {25558#false} is VALID [2022-04-27 10:18:32,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {25558#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,775 INFO L290 TraceCheckUtils]: 67: Hoare triple {25558#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,775 INFO L290 TraceCheckUtils]: 68: Hoare triple {25558#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,775 INFO L290 TraceCheckUtils]: 69: Hoare triple {25558#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,775 INFO L290 TraceCheckUtils]: 70: Hoare triple {25558#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,775 INFO L290 TraceCheckUtils]: 71: Hoare triple {25558#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,775 INFO L290 TraceCheckUtils]: 72: Hoare triple {25558#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,775 INFO L290 TraceCheckUtils]: 73: Hoare triple {25558#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,776 INFO L290 TraceCheckUtils]: 74: Hoare triple {25558#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,776 INFO L290 TraceCheckUtils]: 75: Hoare triple {25558#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,776 INFO L290 TraceCheckUtils]: 76: Hoare triple {25558#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,776 INFO L290 TraceCheckUtils]: 77: Hoare triple {25558#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,776 INFO L290 TraceCheckUtils]: 78: Hoare triple {25558#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,776 INFO L290 TraceCheckUtils]: 79: Hoare triple {25558#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25558#false} is VALID [2022-04-27 10:18:32,776 INFO L290 TraceCheckUtils]: 80: Hoare triple {25558#false} assume 4432 == #t~mem56;havoc #t~mem56; {25558#false} is VALID [2022-04-27 10:18:32,776 INFO L290 TraceCheckUtils]: 81: Hoare triple {25558#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {25558#false} is VALID [2022-04-27 10:18:32,776 INFO L290 TraceCheckUtils]: 82: Hoare triple {25558#false} assume 5 == ~blastFlag~0; {25558#false} is VALID [2022-04-27 10:18:32,776 INFO L290 TraceCheckUtils]: 83: Hoare triple {25558#false} assume !false; {25558#false} is VALID [2022-04-27 10:18:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:18:32,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:32,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345225055] [2022-04-27 10:18:32,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345225055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:32,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:32,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:32,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646552818] [2022-04-27 10:18:32,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:32,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 10:18:32,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:32,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:32,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:32,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:32,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:32,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:32,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:32,857 INFO L87 Difference]: Start difference. First operand 556 states and 875 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:34,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:18:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:36,184 INFO L93 Difference]: Finished difference Result 1271 states and 1987 transitions. [2022-04-27 10:18:36,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:36,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 10:18:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-27 10:18:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-27 10:18:36,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-27 10:18:36,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:36,516 INFO L225 Difference]: With dead ends: 1271 [2022-04-27 10:18:36,517 INFO L226 Difference]: Without dead ends: 728 [2022-04-27 10:18:36,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:36,518 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 88 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:36,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 564 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 10:18:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-04-27 10:18:36,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 602. [2022-04-27 10:18:36,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:36,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 728 states. Second operand has 602 states, 597 states have (on average 1.5896147403685092) internal successors, (949), 597 states have internal predecessors, (949), 3 states have call successors, (3), 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-27 10:18:36,534 INFO L74 IsIncluded]: Start isIncluded. First operand 728 states. Second operand has 602 states, 597 states have (on average 1.5896147403685092) internal successors, (949), 597 states have internal predecessors, (949), 3 states have call successors, (3), 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-27 10:18:36,535 INFO L87 Difference]: Start difference. First operand 728 states. Second operand has 602 states, 597 states have (on average 1.5896147403685092) internal successors, (949), 597 states have internal predecessors, (949), 3 states have call successors, (3), 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-27 10:18:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:36,559 INFO L93 Difference]: Finished difference Result 728 states and 1127 transitions. [2022-04-27 10:18:36,559 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1127 transitions. [2022-04-27 10:18:36,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:36,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:36,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 602 states, 597 states have (on average 1.5896147403685092) internal successors, (949), 597 states have internal predecessors, (949), 3 states have call successors, (3), 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 728 states. [2022-04-27 10:18:36,562 INFO L87 Difference]: Start difference. First operand has 602 states, 597 states have (on average 1.5896147403685092) internal successors, (949), 597 states have internal predecessors, (949), 3 states have call successors, (3), 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 728 states. [2022-04-27 10:18:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:36,586 INFO L93 Difference]: Finished difference Result 728 states and 1127 transitions. [2022-04-27 10:18:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1127 transitions. [2022-04-27 10:18:36,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:36,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:36,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:36,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 597 states have (on average 1.5896147403685092) internal successors, (949), 597 states have internal predecessors, (949), 3 states have call successors, (3), 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-27 10:18:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 953 transitions. [2022-04-27 10:18:36,606 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 953 transitions. Word has length 84 [2022-04-27 10:18:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:36,606 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 953 transitions. [2022-04-27 10:18:36,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 953 transitions. [2022-04-27 10:18:36,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 10:18:36,608 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:36,608 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:36,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 10:18:36,608 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:36,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:36,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2056867335, now seen corresponding path program 1 times [2022-04-27 10:18:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:36,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943924356] [2022-04-27 10:18:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:36,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:36,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:36,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {29121#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {29114#true} is VALID [2022-04-27 10:18:36,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {29114#true} assume true; {29114#true} is VALID [2022-04-27 10:18:36,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29114#true} {29114#true} #591#return; {29114#true} is VALID [2022-04-27 10:18:36,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {29114#true} call ULTIMATE.init(); {29121#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:36,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {29121#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {29114#true} is VALID [2022-04-27 10:18:36,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {29114#true} assume true; {29114#true} is VALID [2022-04-27 10:18:36,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29114#true} {29114#true} #591#return; {29114#true} is VALID [2022-04-27 10:18:36,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {29114#true} call #t~ret159 := main(); {29114#true} is VALID [2022-04-27 10:18:36,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {29114#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {29114#true} is VALID [2022-04-27 10:18:36,753 INFO L272 TraceCheckUtils]: 6: Hoare triple {29114#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {29114#true} is VALID [2022-04-27 10:18:36,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {29114#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {29114#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {29114#true} is VALID [2022-04-27 10:18:36,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {29114#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {29114#true} is VALID [2022-04-27 10:18:36,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {29114#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29114#true} is VALID [2022-04-27 10:18:36,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {29114#true} assume !false; {29114#true} is VALID [2022-04-27 10:18:36,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {29114#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {29114#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {29114#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {29114#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {29114#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {29114#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {29114#true} assume 4368 == #t~mem48;havoc #t~mem48; {29114#true} is VALID [2022-04-27 10:18:36,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {29114#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {29114#true} is VALID [2022-04-27 10:18:36,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {29114#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29114#true} is VALID [2022-04-27 10:18:36,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {29114#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {29114#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {29114#true} is VALID [2022-04-27 10:18:36,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {29114#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {29114#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29114#true} is VALID [2022-04-27 10:18:36,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {29114#true} ~skip~0 := 0; {29114#true} is VALID [2022-04-27 10:18:36,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {29114#true} assume !false; {29114#true} is VALID [2022-04-27 10:18:36,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {29114#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {29114#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {29114#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {29114#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {29114#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {29114#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {29114#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {29114#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {29114#true} assume 4384 == #t~mem50;havoc #t~mem50; {29114#true} is VALID [2022-04-27 10:18:36,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {29114#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {29114#true} is VALID [2022-04-27 10:18:36,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {29114#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {29114#true} is VALID [2022-04-27 10:18:36,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {29114#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {29114#true} is VALID [2022-04-27 10:18:36,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {29114#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,757 INFO L290 TraceCheckUtils]: 40: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,757 INFO L290 TraceCheckUtils]: 41: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,758 INFO L290 TraceCheckUtils]: 43: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,759 INFO L290 TraceCheckUtils]: 45: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,759 INFO L290 TraceCheckUtils]: 46: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,759 INFO L290 TraceCheckUtils]: 47: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,760 INFO L290 TraceCheckUtils]: 49: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,760 INFO L290 TraceCheckUtils]: 50: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,761 INFO L290 TraceCheckUtils]: 52: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,761 INFO L290 TraceCheckUtils]: 53: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:36,761 INFO L290 TraceCheckUtils]: 54: Hoare triple {29119#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29120#(= |ssl3_connect_#t~mem52| 4400)} is VALID [2022-04-27 10:18:36,774 INFO L290 TraceCheckUtils]: 55: Hoare triple {29120#(= |ssl3_connect_#t~mem52| 4400)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {29115#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {29115#false} assume 4416 == #t~mem54;havoc #t~mem54; {29115#false} is VALID [2022-04-27 10:18:36,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {29115#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {29115#false} is VALID [2022-04-27 10:18:36,775 INFO L290 TraceCheckUtils]: 59: Hoare triple {29115#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {29115#false} is VALID [2022-04-27 10:18:36,775 INFO L290 TraceCheckUtils]: 60: Hoare triple {29115#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {29115#false} is VALID [2022-04-27 10:18:36,775 INFO L290 TraceCheckUtils]: 61: Hoare triple {29115#false} assume !(0 == ~tmp___6~0); {29115#false} is VALID [2022-04-27 10:18:36,775 INFO L290 TraceCheckUtils]: 62: Hoare triple {29115#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,775 INFO L290 TraceCheckUtils]: 63: Hoare triple {29115#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29115#false} is VALID [2022-04-27 10:18:36,775 INFO L290 TraceCheckUtils]: 64: Hoare triple {29115#false} ~skip~0 := 0; {29115#false} is VALID [2022-04-27 10:18:36,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {29115#false} assume !false; {29115#false} is VALID [2022-04-27 10:18:36,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {29115#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,775 INFO L290 TraceCheckUtils]: 67: Hoare triple {29115#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,775 INFO L290 TraceCheckUtils]: 68: Hoare triple {29115#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,775 INFO L290 TraceCheckUtils]: 69: Hoare triple {29115#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,775 INFO L290 TraceCheckUtils]: 70: Hoare triple {29115#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,776 INFO L290 TraceCheckUtils]: 71: Hoare triple {29115#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,776 INFO L290 TraceCheckUtils]: 72: Hoare triple {29115#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,776 INFO L290 TraceCheckUtils]: 73: Hoare triple {29115#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,776 INFO L290 TraceCheckUtils]: 74: Hoare triple {29115#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,776 INFO L290 TraceCheckUtils]: 75: Hoare triple {29115#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,776 INFO L290 TraceCheckUtils]: 76: Hoare triple {29115#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,776 INFO L290 TraceCheckUtils]: 77: Hoare triple {29115#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,776 INFO L290 TraceCheckUtils]: 78: Hoare triple {29115#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,776 INFO L290 TraceCheckUtils]: 79: Hoare triple {29115#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29115#false} is VALID [2022-04-27 10:18:36,776 INFO L290 TraceCheckUtils]: 80: Hoare triple {29115#false} assume 4432 == #t~mem56;havoc #t~mem56; {29115#false} is VALID [2022-04-27 10:18:36,776 INFO L290 TraceCheckUtils]: 81: Hoare triple {29115#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {29115#false} is VALID [2022-04-27 10:18:36,777 INFO L290 TraceCheckUtils]: 82: Hoare triple {29115#false} assume 5 == ~blastFlag~0; {29115#false} is VALID [2022-04-27 10:18:36,777 INFO L290 TraceCheckUtils]: 83: Hoare triple {29115#false} assume !false; {29115#false} is VALID [2022-04-27 10:18:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 10:18:36,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:36,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943924356] [2022-04-27 10:18:36,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943924356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:36,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:36,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:36,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521533556] [2022-04-27 10:18:36,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:36,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 10:18:36,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:36,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:36,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:36,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:36,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:36,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:36,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:36,840 INFO L87 Difference]: Start difference. First operand 602 states and 953 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:38,866 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:18:39,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:39,895 INFO L93 Difference]: Finished difference Result 1275 states and 2014 transitions. [2022-04-27 10:18:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:39,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 10:18:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2022-04-27 10:18:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2022-04-27 10:18:39,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 402 transitions. [2022-04-27 10:18:40,168 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-27 10:18:40,185 INFO L225 Difference]: With dead ends: 1275 [2022-04-27 10:18:40,185 INFO L226 Difference]: Without dead ends: 686 [2022-04-27 10:18:40,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:40,187 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 38 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:40,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 510 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 10:18:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-04-27 10:18:40,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 642. [2022-04-27 10:18:40,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:40,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 686 states. Second operand has 642 states, 637 states have (on average 1.596546310832025) internal successors, (1017), 637 states have internal predecessors, (1017), 3 states have call successors, (3), 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-27 10:18:40,204 INFO L74 IsIncluded]: Start isIncluded. First operand 686 states. Second operand has 642 states, 637 states have (on average 1.596546310832025) internal successors, (1017), 637 states have internal predecessors, (1017), 3 states have call successors, (3), 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-27 10:18:40,205 INFO L87 Difference]: Start difference. First operand 686 states. Second operand has 642 states, 637 states have (on average 1.596546310832025) internal successors, (1017), 637 states have internal predecessors, (1017), 3 states have call successors, (3), 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-27 10:18:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:40,227 INFO L93 Difference]: Finished difference Result 686 states and 1076 transitions. [2022-04-27 10:18:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1076 transitions. [2022-04-27 10:18:40,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:40,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:40,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 642 states, 637 states have (on average 1.596546310832025) internal successors, (1017), 637 states have internal predecessors, (1017), 3 states have call successors, (3), 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 686 states. [2022-04-27 10:18:40,229 INFO L87 Difference]: Start difference. First operand has 642 states, 637 states have (on average 1.596546310832025) internal successors, (1017), 637 states have internal predecessors, (1017), 3 states have call successors, (3), 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 686 states. [2022-04-27 10:18:40,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:40,251 INFO L93 Difference]: Finished difference Result 686 states and 1076 transitions. [2022-04-27 10:18:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1076 transitions. [2022-04-27 10:18:40,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:40,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:40,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:40,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 637 states have (on average 1.596546310832025) internal successors, (1017), 637 states have internal predecessors, (1017), 3 states have call successors, (3), 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-27 10:18:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1021 transitions. [2022-04-27 10:18:40,274 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1021 transitions. Word has length 84 [2022-04-27 10:18:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:40,274 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 1021 transitions. [2022-04-27 10:18:40,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1021 transitions. [2022-04-27 10:18:40,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 10:18:40,275 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:40,276 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:40,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 10:18:40,276 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:40,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:40,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1451323138, now seen corresponding path program 1 times [2022-04-27 10:18:40,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:40,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030522942] [2022-04-27 10:18:40,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:40,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:40,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:40,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {32628#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {32621#true} is VALID [2022-04-27 10:18:40,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {32621#true} assume true; {32621#true} is VALID [2022-04-27 10:18:40,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32621#true} {32621#true} #591#return; {32621#true} is VALID [2022-04-27 10:18:40,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {32621#true} call ULTIMATE.init(); {32628#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:40,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {32628#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {32621#true} is VALID [2022-04-27 10:18:40,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {32621#true} assume true; {32621#true} is VALID [2022-04-27 10:18:40,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32621#true} {32621#true} #591#return; {32621#true} is VALID [2022-04-27 10:18:40,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {32621#true} call #t~ret159 := main(); {32621#true} is VALID [2022-04-27 10:18:40,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {32621#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {32621#true} is VALID [2022-04-27 10:18:40,419 INFO L272 TraceCheckUtils]: 6: Hoare triple {32621#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {32621#true} is VALID [2022-04-27 10:18:40,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {32621#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {32621#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {32621#true} is VALID [2022-04-27 10:18:40,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {32621#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {32621#true} is VALID [2022-04-27 10:18:40,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {32621#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32621#true} is VALID [2022-04-27 10:18:40,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {32621#true} assume !false; {32621#true} is VALID [2022-04-27 10:18:40,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {32621#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {32621#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {32621#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {32621#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {32621#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {32621#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {32621#true} assume 4368 == #t~mem48;havoc #t~mem48; {32621#true} is VALID [2022-04-27 10:18:40,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {32621#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {32621#true} is VALID [2022-04-27 10:18:40,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {32621#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32621#true} is VALID [2022-04-27 10:18:40,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {32621#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {32621#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {32621#true} is VALID [2022-04-27 10:18:40,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {32621#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {32621#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {32621#true} is VALID [2022-04-27 10:18:40,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {32621#true} ~skip~0 := 0; {32621#true} is VALID [2022-04-27 10:18:40,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {32621#true} assume !false; {32621#true} is VALID [2022-04-27 10:18:40,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {32621#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {32621#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {32621#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {32621#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {32621#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {32621#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {32621#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {32621#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {32621#true} assume 4384 == #t~mem50;havoc #t~mem50; {32621#true} is VALID [2022-04-27 10:18:40,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {32621#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {32621#true} is VALID [2022-04-27 10:18:40,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {32621#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {32621#true} is VALID [2022-04-27 10:18:40,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {32621#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {32621#true} is VALID [2022-04-27 10:18:40,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {32621#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,438 INFO L290 TraceCheckUtils]: 43: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,438 INFO L290 TraceCheckUtils]: 44: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,439 INFO L290 TraceCheckUtils]: 46: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,440 INFO L290 TraceCheckUtils]: 49: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,440 INFO L290 TraceCheckUtils]: 50: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,441 INFO L290 TraceCheckUtils]: 51: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,442 INFO L290 TraceCheckUtils]: 55: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:40,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {32626#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32627#(= |ssl3_connect_#t~mem55| 4560)} is VALID [2022-04-27 10:18:40,443 INFO L290 TraceCheckUtils]: 58: Hoare triple {32627#(= |ssl3_connect_#t~mem55| 4560)} assume 4417 == #t~mem55;havoc #t~mem55; {32622#false} is VALID [2022-04-27 10:18:40,443 INFO L290 TraceCheckUtils]: 59: Hoare triple {32622#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {32622#false} is VALID [2022-04-27 10:18:40,443 INFO L290 TraceCheckUtils]: 60: Hoare triple {32622#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 61: Hoare triple {32622#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 62: Hoare triple {32622#false} assume !(0 == ~tmp___6~0); {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 63: Hoare triple {32622#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 64: Hoare triple {32622#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 65: Hoare triple {32622#false} ~skip~0 := 0; {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 66: Hoare triple {32622#false} assume !false; {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 67: Hoare triple {32622#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 68: Hoare triple {32622#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 69: Hoare triple {32622#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 70: Hoare triple {32622#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 71: Hoare triple {32622#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 72: Hoare triple {32622#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 73: Hoare triple {32622#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 74: Hoare triple {32622#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,444 INFO L290 TraceCheckUtils]: 75: Hoare triple {32622#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,445 INFO L290 TraceCheckUtils]: 76: Hoare triple {32622#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,445 INFO L290 TraceCheckUtils]: 77: Hoare triple {32622#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,445 INFO L290 TraceCheckUtils]: 78: Hoare triple {32622#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,445 INFO L290 TraceCheckUtils]: 79: Hoare triple {32622#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,445 INFO L290 TraceCheckUtils]: 80: Hoare triple {32622#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {32622#false} is VALID [2022-04-27 10:18:40,445 INFO L290 TraceCheckUtils]: 81: Hoare triple {32622#false} assume 4432 == #t~mem56;havoc #t~mem56; {32622#false} is VALID [2022-04-27 10:18:40,452 INFO L290 TraceCheckUtils]: 82: Hoare triple {32622#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {32622#false} is VALID [2022-04-27 10:18:40,452 INFO L290 TraceCheckUtils]: 83: Hoare triple {32622#false} assume 5 == ~blastFlag~0; {32622#false} is VALID [2022-04-27 10:18:40,452 INFO L290 TraceCheckUtils]: 84: Hoare triple {32622#false} assume !false; {32622#false} is VALID [2022-04-27 10:18:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:18:40,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:40,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030522942] [2022-04-27 10:18:40,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030522942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:40,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:40,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:40,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808073334] [2022-04-27 10:18:40,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:40,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 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 85 [2022-04-27 10:18:40,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:40,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:40,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:40,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:40,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:40,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:40,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:40,517 INFO L87 Difference]: Start difference. First operand 642 states and 1021 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:42,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:18:43,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:43,791 INFO L93 Difference]: Finished difference Result 1391 states and 2192 transitions. [2022-04-27 10:18:43,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:43,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 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 85 [2022-04-27 10:18:43,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-27 10:18:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-27 10:18:43,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-27 10:18:44,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:44,122 INFO L225 Difference]: With dead ends: 1391 [2022-04-27 10:18:44,122 INFO L226 Difference]: Without dead ends: 762 [2022-04-27 10:18:44,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:44,123 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 83 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:44,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 556 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 520 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 10:18:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-04-27 10:18:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 644. [2022-04-27 10:18:44,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:44,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 762 states. Second operand has 644 states, 639 states have (on average 1.594679186228482) internal successors, (1019), 639 states have internal predecessors, (1019), 3 states have call successors, (3), 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-27 10:18:44,140 INFO L74 IsIncluded]: Start isIncluded. First operand 762 states. Second operand has 644 states, 639 states have (on average 1.594679186228482) internal successors, (1019), 639 states have internal predecessors, (1019), 3 states have call successors, (3), 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-27 10:18:44,140 INFO L87 Difference]: Start difference. First operand 762 states. Second operand has 644 states, 639 states have (on average 1.594679186228482) internal successors, (1019), 639 states have internal predecessors, (1019), 3 states have call successors, (3), 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-27 10:18:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:44,160 INFO L93 Difference]: Finished difference Result 762 states and 1186 transitions. [2022-04-27 10:18:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1186 transitions. [2022-04-27 10:18:44,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:44,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:44,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 644 states, 639 states have (on average 1.594679186228482) internal successors, (1019), 639 states have internal predecessors, (1019), 3 states have call successors, (3), 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 762 states. [2022-04-27 10:18:44,162 INFO L87 Difference]: Start difference. First operand has 644 states, 639 states have (on average 1.594679186228482) internal successors, (1019), 639 states have internal predecessors, (1019), 3 states have call successors, (3), 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 762 states. [2022-04-27 10:18:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:44,188 INFO L93 Difference]: Finished difference Result 762 states and 1186 transitions. [2022-04-27 10:18:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1186 transitions. [2022-04-27 10:18:44,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:44,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:44,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:44,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 639 states have (on average 1.594679186228482) internal successors, (1019), 639 states have internal predecessors, (1019), 3 states have call successors, (3), 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-27 10:18:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1023 transitions. [2022-04-27 10:18:44,210 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1023 transitions. Word has length 85 [2022-04-27 10:18:44,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:44,210 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 1023 transitions. [2022-04-27 10:18:44,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1023 transitions. [2022-04-27 10:18:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-27 10:18:44,212 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:44,212 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:44,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 10:18:44,212 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:44,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:44,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1229992776, now seen corresponding path program 1 times [2022-04-27 10:18:44,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:44,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534675435] [2022-04-27 10:18:44,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:44,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:44,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:44,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {36421#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {36414#true} is VALID [2022-04-27 10:18:44,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {36414#true} assume true; {36414#true} is VALID [2022-04-27 10:18:44,366 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36414#true} {36414#true} #591#return; {36414#true} is VALID [2022-04-27 10:18:44,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {36414#true} call ULTIMATE.init(); {36421#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:44,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {36421#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {36414#true} is VALID [2022-04-27 10:18:44,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {36414#true} assume true; {36414#true} is VALID [2022-04-27 10:18:44,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36414#true} {36414#true} #591#return; {36414#true} is VALID [2022-04-27 10:18:44,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {36414#true} call #t~ret159 := main(); {36414#true} is VALID [2022-04-27 10:18:44,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {36414#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {36414#true} is VALID [2022-04-27 10:18:44,367 INFO L272 TraceCheckUtils]: 6: Hoare triple {36414#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {36414#true} is VALID [2022-04-27 10:18:44,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {36414#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {36414#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {36414#true} is VALID [2022-04-27 10:18:44,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {36414#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {36414#true} is VALID [2022-04-27 10:18:44,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {36414#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36414#true} is VALID [2022-04-27 10:18:44,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {36414#true} assume !false; {36414#true} is VALID [2022-04-27 10:18:44,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {36414#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {36414#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {36414#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {36414#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {36414#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {36414#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {36414#true} assume 4368 == #t~mem48;havoc #t~mem48; {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {36414#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {36414#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {36414#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {36414#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {36414#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {36414#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {36414#true} ~skip~0 := 0; {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {36414#true} assume !false; {36414#true} is VALID [2022-04-27 10:18:44,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {36414#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {36414#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {36414#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {36414#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {36414#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {36414#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {36414#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {36414#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {36414#true} assume 4384 == #t~mem50;havoc #t~mem50; {36414#true} is VALID [2022-04-27 10:18:44,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {36414#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {36414#true} is VALID [2022-04-27 10:18:44,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {36414#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {36414#true} is VALID [2022-04-27 10:18:44,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {36414#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {36414#true} is VALID [2022-04-27 10:18:44,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {36414#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {36419#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:44,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {36419#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {36419#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:44,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {36419#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {36419#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:44,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {36419#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {36419#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:44,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {36419#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {36419#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:44,372 INFO L290 TraceCheckUtils]: 44: Hoare triple {36419#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {36419#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:18:44,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {36419#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {36420#(= |ssl3_connect_#t~mem43| 4560)} is VALID [2022-04-27 10:18:44,373 INFO L290 TraceCheckUtils]: 46: Hoare triple {36420#(= |ssl3_connect_#t~mem43| 4560)} assume 12292 == #t~mem43;havoc #t~mem43; {36415#false} is VALID [2022-04-27 10:18:44,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {36415#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {36415#false} is VALID [2022-04-27 10:18:44,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {36415#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {36415#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {36415#false} is VALID [2022-04-27 10:18:44,374 INFO L290 TraceCheckUtils]: 50: Hoare triple {36415#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,374 INFO L290 TraceCheckUtils]: 51: Hoare triple {36415#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,374 INFO L290 TraceCheckUtils]: 52: Hoare triple {36415#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {36415#false} is VALID [2022-04-27 10:18:44,374 INFO L290 TraceCheckUtils]: 53: Hoare triple {36415#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {36415#false} is VALID [2022-04-27 10:18:44,374 INFO L290 TraceCheckUtils]: 54: Hoare triple {36415#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {36415#false} is VALID [2022-04-27 10:18:44,374 INFO L290 TraceCheckUtils]: 55: Hoare triple {36415#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,374 INFO L290 TraceCheckUtils]: 56: Hoare triple {36415#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,374 INFO L290 TraceCheckUtils]: 57: Hoare triple {36415#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {36415#false} is VALID [2022-04-27 10:18:44,374 INFO L290 TraceCheckUtils]: 58: Hoare triple {36415#false} ~skip~0 := 0; {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 59: Hoare triple {36415#false} assume !false; {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 60: Hoare triple {36415#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 61: Hoare triple {36415#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 62: Hoare triple {36415#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 63: Hoare triple {36415#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 64: Hoare triple {36415#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {36415#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 66: Hoare triple {36415#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 67: Hoare triple {36415#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 68: Hoare triple {36415#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 69: Hoare triple {36415#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 70: Hoare triple {36415#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 71: Hoare triple {36415#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 72: Hoare triple {36415#false} assume 4416 == #t~mem54;havoc #t~mem54; {36415#false} is VALID [2022-04-27 10:18:44,375 INFO L290 TraceCheckUtils]: 73: Hoare triple {36415#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 74: Hoare triple {36415#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 75: Hoare triple {36415#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 76: Hoare triple {36415#false} assume !(0 == ~tmp___6~0); {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 77: Hoare triple {36415#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 78: Hoare triple {36415#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 79: Hoare triple {36415#false} ~skip~0 := 0; {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 80: Hoare triple {36415#false} assume !false; {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 81: Hoare triple {36415#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 82: Hoare triple {36415#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 83: Hoare triple {36415#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 84: Hoare triple {36415#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 85: Hoare triple {36415#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 86: Hoare triple {36415#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 87: Hoare triple {36415#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,376 INFO L290 TraceCheckUtils]: 88: Hoare triple {36415#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,377 INFO L290 TraceCheckUtils]: 89: Hoare triple {36415#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,377 INFO L290 TraceCheckUtils]: 90: Hoare triple {36415#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,377 INFO L290 TraceCheckUtils]: 91: Hoare triple {36415#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,377 INFO L290 TraceCheckUtils]: 92: Hoare triple {36415#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,377 INFO L290 TraceCheckUtils]: 93: Hoare triple {36415#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,377 INFO L290 TraceCheckUtils]: 94: Hoare triple {36415#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36415#false} is VALID [2022-04-27 10:18:44,377 INFO L290 TraceCheckUtils]: 95: Hoare triple {36415#false} assume 4432 == #t~mem56;havoc #t~mem56; {36415#false} is VALID [2022-04-27 10:18:44,377 INFO L290 TraceCheckUtils]: 96: Hoare triple {36415#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {36415#false} is VALID [2022-04-27 10:18:44,377 INFO L290 TraceCheckUtils]: 97: Hoare triple {36415#false} assume 5 == ~blastFlag~0; {36415#false} is VALID [2022-04-27 10:18:44,377 INFO L290 TraceCheckUtils]: 98: Hoare triple {36415#false} assume !false; {36415#false} is VALID [2022-04-27 10:18:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-27 10:18:44,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:44,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534675435] [2022-04-27 10:18:44,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534675435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:44,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:44,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:44,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255540562] [2022-04-27 10:18:44,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:44,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 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 99 [2022-04-27 10:18:44,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:44,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:44,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:44,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:44,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:44,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:44,435 INFO L87 Difference]: Start difference. First operand 644 states and 1023 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:46,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:18:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:47,772 INFO L93 Difference]: Finished difference Result 1391 states and 2190 transitions. [2022-04-27 10:18:47,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:47,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 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 99 [2022-04-27 10:18:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2022-04-27 10:18:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2022-04-27 10:18:47,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 459 transitions. [2022-04-27 10:18:48,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 459 edges. 459 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:48,122 INFO L225 Difference]: With dead ends: 1391 [2022-04-27 10:18:48,122 INFO L226 Difference]: Without dead ends: 760 [2022-04-27 10:18:48,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:48,124 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 94 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:48,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 554 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 515 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 10:18:48,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-04-27 10:18:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 644. [2022-04-27 10:18:48,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:48,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 760 states. Second operand has 644 states, 639 states have (on average 1.591549295774648) internal successors, (1017), 639 states have internal predecessors, (1017), 3 states have call successors, (3), 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-27 10:18:48,140 INFO L74 IsIncluded]: Start isIncluded. First operand 760 states. Second operand has 644 states, 639 states have (on average 1.591549295774648) internal successors, (1017), 639 states have internal predecessors, (1017), 3 states have call successors, (3), 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-27 10:18:48,141 INFO L87 Difference]: Start difference. First operand 760 states. Second operand has 644 states, 639 states have (on average 1.591549295774648) internal successors, (1017), 639 states have internal predecessors, (1017), 3 states have call successors, (3), 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-27 10:18:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:48,166 INFO L93 Difference]: Finished difference Result 760 states and 1182 transitions. [2022-04-27 10:18:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1182 transitions. [2022-04-27 10:18:48,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:48,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:48,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 644 states, 639 states have (on average 1.591549295774648) internal successors, (1017), 639 states have internal predecessors, (1017), 3 states have call successors, (3), 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 760 states. [2022-04-27 10:18:48,168 INFO L87 Difference]: Start difference. First operand has 644 states, 639 states have (on average 1.591549295774648) internal successors, (1017), 639 states have internal predecessors, (1017), 3 states have call successors, (3), 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 760 states. [2022-04-27 10:18:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:48,194 INFO L93 Difference]: Finished difference Result 760 states and 1182 transitions. [2022-04-27 10:18:48,194 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1182 transitions. [2022-04-27 10:18:48,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:48,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:48,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:48,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 639 states have (on average 1.591549295774648) internal successors, (1017), 639 states have internal predecessors, (1017), 3 states have call successors, (3), 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-27 10:18:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1021 transitions. [2022-04-27 10:18:48,223 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1021 transitions. Word has length 99 [2022-04-27 10:18:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:48,223 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 1021 transitions. [2022-04-27 10:18:48,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1021 transitions. [2022-04-27 10:18:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-27 10:18:48,225 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:48,225 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:48,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 10:18:48,226 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:48,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:48,226 INFO L85 PathProgramCache]: Analyzing trace with hash 311489703, now seen corresponding path program 1 times [2022-04-27 10:18:48,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:48,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725750453] [2022-04-27 10:18:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:48,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:48,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:48,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {40208#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {40201#true} is VALID [2022-04-27 10:18:48,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {40201#true} assume true; {40201#true} is VALID [2022-04-27 10:18:48,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40201#true} {40201#true} #591#return; {40201#true} is VALID [2022-04-27 10:18:48,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {40201#true} call ULTIMATE.init(); {40208#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:48,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {40208#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {40201#true} is VALID [2022-04-27 10:18:48,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {40201#true} assume true; {40201#true} is VALID [2022-04-27 10:18:48,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40201#true} {40201#true} #591#return; {40201#true} is VALID [2022-04-27 10:18:48,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {40201#true} call #t~ret159 := main(); {40201#true} is VALID [2022-04-27 10:18:48,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {40201#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {40201#true} is VALID [2022-04-27 10:18:48,370 INFO L272 TraceCheckUtils]: 6: Hoare triple {40201#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {40201#true} is VALID [2022-04-27 10:18:48,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {40201#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {40201#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {40201#true} is VALID [2022-04-27 10:18:48,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {40201#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {40201#true} is VALID [2022-04-27 10:18:48,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {40201#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {40201#true} is VALID [2022-04-27 10:18:48,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {40201#true} assume !false; {40201#true} is VALID [2022-04-27 10:18:48,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {40201#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {40201#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {40201#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {40201#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {40201#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {40201#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {40201#true} assume 4368 == #t~mem48;havoc #t~mem48; {40201#true} is VALID [2022-04-27 10:18:48,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {40201#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {40201#true} is VALID [2022-04-27 10:18:48,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {40201#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {40201#true} is VALID [2022-04-27 10:18:48,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {40201#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {40201#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {40201#true} is VALID [2022-04-27 10:18:48,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {40201#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {40201#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {40201#true} is VALID [2022-04-27 10:18:48,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {40201#true} ~skip~0 := 0; {40201#true} is VALID [2022-04-27 10:18:48,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {40201#true} assume !false; {40201#true} is VALID [2022-04-27 10:18:48,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {40201#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {40201#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {40201#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {40201#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {40201#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {40201#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {40201#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {40201#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {40201#true} assume 4384 == #t~mem50;havoc #t~mem50; {40201#true} is VALID [2022-04-27 10:18:48,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {40201#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {40201#true} is VALID [2022-04-27 10:18:48,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {40201#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {40201#true} is VALID [2022-04-27 10:18:48,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {40201#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {40201#true} is VALID [2022-04-27 10:18:48,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {40201#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:48,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:48,374 INFO L290 TraceCheckUtils]: 41: Hoare triple {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:48,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:48,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:48,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:48,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:48,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:48,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:48,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:48,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:48,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {40206#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40207#(not (= |ssl3_connect_#t~mem48| 4368))} is VALID [2022-04-27 10:18:48,377 INFO L290 TraceCheckUtils]: 51: Hoare triple {40207#(not (= |ssl3_connect_#t~mem48| 4368))} assume 4368 == #t~mem48;havoc #t~mem48; {40202#false} is VALID [2022-04-27 10:18:48,377 INFO L290 TraceCheckUtils]: 52: Hoare triple {40202#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {40202#false} is VALID [2022-04-27 10:18:48,377 INFO L290 TraceCheckUtils]: 53: Hoare triple {40202#false} assume !(0 == ~blastFlag~0); {40202#false} is VALID [2022-04-27 10:18:48,377 INFO L290 TraceCheckUtils]: 54: Hoare triple {40202#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,378 INFO L290 TraceCheckUtils]: 55: Hoare triple {40202#false} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {40202#false} is VALID [2022-04-27 10:18:48,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {40202#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {40202#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {40202#false} is VALID [2022-04-27 10:18:48,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {40202#false} ~skip~0 := 0; {40202#false} is VALID [2022-04-27 10:18:48,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {40202#false} assume !false; {40202#false} is VALID [2022-04-27 10:18:48,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {40202#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {40202#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,378 INFO L290 TraceCheckUtils]: 62: Hoare triple {40202#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,378 INFO L290 TraceCheckUtils]: 63: Hoare triple {40202#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,378 INFO L290 TraceCheckUtils]: 64: Hoare triple {40202#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,378 INFO L290 TraceCheckUtils]: 65: Hoare triple {40202#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,378 INFO L290 TraceCheckUtils]: 66: Hoare triple {40202#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,378 INFO L290 TraceCheckUtils]: 67: Hoare triple {40202#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,378 INFO L290 TraceCheckUtils]: 68: Hoare triple {40202#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,379 INFO L290 TraceCheckUtils]: 69: Hoare triple {40202#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,379 INFO L290 TraceCheckUtils]: 70: Hoare triple {40202#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,379 INFO L290 TraceCheckUtils]: 71: Hoare triple {40202#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,379 INFO L290 TraceCheckUtils]: 72: Hoare triple {40202#false} assume 4416 == #t~mem54;havoc #t~mem54; {40202#false} is VALID [2022-04-27 10:18:48,379 INFO L290 TraceCheckUtils]: 73: Hoare triple {40202#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {40202#false} is VALID [2022-04-27 10:18:48,379 INFO L290 TraceCheckUtils]: 74: Hoare triple {40202#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {40202#false} is VALID [2022-04-27 10:18:48,379 INFO L290 TraceCheckUtils]: 75: Hoare triple {40202#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {40202#false} is VALID [2022-04-27 10:18:48,379 INFO L290 TraceCheckUtils]: 76: Hoare triple {40202#false} assume !(0 == ~tmp___6~0); {40202#false} is VALID [2022-04-27 10:18:48,379 INFO L290 TraceCheckUtils]: 77: Hoare triple {40202#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,379 INFO L290 TraceCheckUtils]: 78: Hoare triple {40202#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {40202#false} is VALID [2022-04-27 10:18:48,379 INFO L290 TraceCheckUtils]: 79: Hoare triple {40202#false} ~skip~0 := 0; {40202#false} is VALID [2022-04-27 10:18:48,379 INFO L290 TraceCheckUtils]: 80: Hoare triple {40202#false} assume !false; {40202#false} is VALID [2022-04-27 10:18:48,379 INFO L290 TraceCheckUtils]: 81: Hoare triple {40202#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,380 INFO L290 TraceCheckUtils]: 82: Hoare triple {40202#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,380 INFO L290 TraceCheckUtils]: 83: Hoare triple {40202#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,380 INFO L290 TraceCheckUtils]: 84: Hoare triple {40202#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,380 INFO L290 TraceCheckUtils]: 85: Hoare triple {40202#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,380 INFO L290 TraceCheckUtils]: 86: Hoare triple {40202#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,380 INFO L290 TraceCheckUtils]: 87: Hoare triple {40202#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,380 INFO L290 TraceCheckUtils]: 88: Hoare triple {40202#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,380 INFO L290 TraceCheckUtils]: 89: Hoare triple {40202#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,380 INFO L290 TraceCheckUtils]: 90: Hoare triple {40202#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,380 INFO L290 TraceCheckUtils]: 91: Hoare triple {40202#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,380 INFO L290 TraceCheckUtils]: 92: Hoare triple {40202#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,380 INFO L290 TraceCheckUtils]: 93: Hoare triple {40202#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,380 INFO L290 TraceCheckUtils]: 94: Hoare triple {40202#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40202#false} is VALID [2022-04-27 10:18:48,381 INFO L290 TraceCheckUtils]: 95: Hoare triple {40202#false} assume 4432 == #t~mem56;havoc #t~mem56; {40202#false} is VALID [2022-04-27 10:18:48,381 INFO L290 TraceCheckUtils]: 96: Hoare triple {40202#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {40202#false} is VALID [2022-04-27 10:18:48,381 INFO L290 TraceCheckUtils]: 97: Hoare triple {40202#false} assume 5 == ~blastFlag~0; {40202#false} is VALID [2022-04-27 10:18:48,381 INFO L290 TraceCheckUtils]: 98: Hoare triple {40202#false} assume !false; {40202#false} is VALID [2022-04-27 10:18:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-27 10:18:48,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:48,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725750453] [2022-04-27 10:18:48,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725750453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:48,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:48,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:48,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589225485] [2022-04-27 10:18:48,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:48,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 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 99 [2022-04-27 10:18:48,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:48,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:48,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:48,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:48,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:48,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:48,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:48,446 INFO L87 Difference]: Start difference. First operand 644 states and 1021 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:50,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:18:51,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:51,519 INFO L93 Difference]: Finished difference Result 1328 states and 2070 transitions. [2022-04-27 10:18:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:51,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 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 99 [2022-04-27 10:18:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-27 10:18:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-27 10:18:51,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-27 10:18:51,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:51,882 INFO L225 Difference]: With dead ends: 1328 [2022-04-27 10:18:51,882 INFO L226 Difference]: Without dead ends: 919 [2022-04-27 10:18:51,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:51,884 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 115 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:51,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 326 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 406 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 10:18:51,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-04-27 10:18:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 692. [2022-04-27 10:18:51,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:51,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 919 states. Second operand has 692 states, 687 states have (on average 1.579330422125182) internal successors, (1085), 687 states have internal predecessors, (1085), 3 states have call successors, (3), 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-27 10:18:51,904 INFO L74 IsIncluded]: Start isIncluded. First operand 919 states. Second operand has 692 states, 687 states have (on average 1.579330422125182) internal successors, (1085), 687 states have internal predecessors, (1085), 3 states have call successors, (3), 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-27 10:18:51,905 INFO L87 Difference]: Start difference. First operand 919 states. Second operand has 692 states, 687 states have (on average 1.579330422125182) internal successors, (1085), 687 states have internal predecessors, (1085), 3 states have call successors, (3), 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-27 10:18:51,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:51,943 INFO L93 Difference]: Finished difference Result 919 states and 1407 transitions. [2022-04-27 10:18:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1407 transitions. [2022-04-27 10:18:51,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:51,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:51,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 692 states, 687 states have (on average 1.579330422125182) internal successors, (1085), 687 states have internal predecessors, (1085), 3 states have call successors, (3), 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 919 states. [2022-04-27 10:18:51,946 INFO L87 Difference]: Start difference. First operand has 692 states, 687 states have (on average 1.579330422125182) internal successors, (1085), 687 states have internal predecessors, (1085), 3 states have call successors, (3), 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 919 states. [2022-04-27 10:18:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:51,985 INFO L93 Difference]: Finished difference Result 919 states and 1407 transitions. [2022-04-27 10:18:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1407 transitions. [2022-04-27 10:18:51,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:51,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:51,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:51,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 687 states have (on average 1.579330422125182) internal successors, (1085), 687 states have internal predecessors, (1085), 3 states have call successors, (3), 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-27 10:18:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1089 transitions. [2022-04-27 10:18:52,010 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1089 transitions. Word has length 99 [2022-04-27 10:18:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:52,010 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 1089 transitions. [2022-04-27 10:18:52,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1089 transitions. [2022-04-27 10:18:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 10:18:52,012 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:52,012 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:52,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 10:18:52,012 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:52,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:52,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2137730133, now seen corresponding path program 1 times [2022-04-27 10:18:52,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:52,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199128716] [2022-04-27 10:18:52,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:52,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:52,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:52,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {44308#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {44301#true} is VALID [2022-04-27 10:18:52,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {44301#true} assume true; {44301#true} is VALID [2022-04-27 10:18:52,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44301#true} {44301#true} #591#return; {44301#true} is VALID [2022-04-27 10:18:52,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {44301#true} call ULTIMATE.init(); {44308#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:52,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {44308#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {44301#true} is VALID [2022-04-27 10:18:52,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {44301#true} assume true; {44301#true} is VALID [2022-04-27 10:18:52,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44301#true} {44301#true} #591#return; {44301#true} is VALID [2022-04-27 10:18:52,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {44301#true} call #t~ret159 := main(); {44301#true} is VALID [2022-04-27 10:18:52,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {44301#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {44301#true} is VALID [2022-04-27 10:18:52,167 INFO L272 TraceCheckUtils]: 6: Hoare triple {44301#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {44301#true} is VALID [2022-04-27 10:18:52,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {44301#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {44301#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {44301#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {44301#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {44301#true} assume !false; {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {44301#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {44301#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {44301#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {44301#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {44301#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {44301#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {44301#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {44301#true} assume 4369 == #t~mem49;havoc #t~mem49; {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {44301#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {44301#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {44301#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {44301#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {44301#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {44301#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {44301#true} ~skip~0 := 0; {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {44301#true} assume !false; {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {44301#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {44301#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {44301#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {44301#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {44301#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {44301#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {44301#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {44301#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {44301#true} assume 4384 == #t~mem50;havoc #t~mem50; {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 37: Hoare triple {44301#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 38: Hoare triple {44301#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44301#true} is VALID [2022-04-27 10:18:52,169 INFO L290 TraceCheckUtils]: 39: Hoare triple {44301#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {44301#true} is VALID [2022-04-27 10:18:52,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {44301#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {44306#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:52,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {44306#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44306#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:52,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {44306#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {44306#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:52,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {44306#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {44306#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:52,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {44306#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {44306#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:52,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {44306#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {44306#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:52,173 INFO L290 TraceCheckUtils]: 46: Hoare triple {44306#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {44306#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:52,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {44306#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {44307#(not (= |ssl3_connect_#t~mem44| 16384))} is VALID [2022-04-27 10:18:52,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {44307#(not (= |ssl3_connect_#t~mem44| 16384))} assume 16384 == #t~mem44;havoc #t~mem44; {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 49: Hoare triple {44302#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 50: Hoare triple {44302#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 51: Hoare triple {44302#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 52: Hoare triple {44302#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 53: Hoare triple {44302#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 54: Hoare triple {44302#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 55: Hoare triple {44302#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {44302#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 57: Hoare triple {44302#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 58: Hoare triple {44302#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 59: Hoare triple {44302#false} ~skip~0 := 0; {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 60: Hoare triple {44302#false} assume !false; {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 61: Hoare triple {44302#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 62: Hoare triple {44302#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,174 INFO L290 TraceCheckUtils]: 63: Hoare triple {44302#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 64: Hoare triple {44302#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 65: Hoare triple {44302#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 66: Hoare triple {44302#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 67: Hoare triple {44302#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 68: Hoare triple {44302#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 69: Hoare triple {44302#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 70: Hoare triple {44302#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 71: Hoare triple {44302#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 72: Hoare triple {44302#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 73: Hoare triple {44302#false} assume 4416 == #t~mem54;havoc #t~mem54; {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 74: Hoare triple {44302#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 75: Hoare triple {44302#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 76: Hoare triple {44302#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 77: Hoare triple {44302#false} assume !(0 == ~tmp___6~0); {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 78: Hoare triple {44302#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,175 INFO L290 TraceCheckUtils]: 79: Hoare triple {44302#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 80: Hoare triple {44302#false} ~skip~0 := 0; {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 81: Hoare triple {44302#false} assume !false; {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 82: Hoare triple {44302#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 83: Hoare triple {44302#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 84: Hoare triple {44302#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 85: Hoare triple {44302#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 86: Hoare triple {44302#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 87: Hoare triple {44302#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 88: Hoare triple {44302#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 89: Hoare triple {44302#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 90: Hoare triple {44302#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 91: Hoare triple {44302#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 92: Hoare triple {44302#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 93: Hoare triple {44302#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,176 INFO L290 TraceCheckUtils]: 94: Hoare triple {44302#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,177 INFO L290 TraceCheckUtils]: 95: Hoare triple {44302#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44302#false} is VALID [2022-04-27 10:18:52,177 INFO L290 TraceCheckUtils]: 96: Hoare triple {44302#false} assume 4432 == #t~mem56;havoc #t~mem56; {44302#false} is VALID [2022-04-27 10:18:52,177 INFO L290 TraceCheckUtils]: 97: Hoare triple {44302#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {44302#false} is VALID [2022-04-27 10:18:52,177 INFO L290 TraceCheckUtils]: 98: Hoare triple {44302#false} assume 5 == ~blastFlag~0; {44302#false} is VALID [2022-04-27 10:18:52,177 INFO L290 TraceCheckUtils]: 99: Hoare triple {44302#false} assume !false; {44302#false} is VALID [2022-04-27 10:18:52,177 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 10:18:52,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:52,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199128716] [2022-04-27 10:18:52,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199128716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:52,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:52,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:52,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483853951] [2022-04-27 10:18:52,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:52,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 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 100 [2022-04-27 10:18:52,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:52,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:52,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:52,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:52,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:52,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:52,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:52,243 INFO L87 Difference]: Start difference. First operand 692 states and 1089 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:54,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:18:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:55,294 INFO L93 Difference]: Finished difference Result 1565 states and 2425 transitions. [2022-04-27 10:18:55,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:55,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 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 100 [2022-04-27 10:18:55,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-27 10:18:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-27 10:18:55,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-27 10:18:55,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:55,653 INFO L225 Difference]: With dead ends: 1565 [2022-04-27 10:18:55,654 INFO L226 Difference]: Without dead ends: 886 [2022-04-27 10:18:55,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:55,655 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 119 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:55,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 298 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 10:18:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-04-27 10:18:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 692. [2022-04-27 10:18:55,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:55,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 886 states. Second operand has 692 states, 687 states have (on average 1.5560407569141192) internal successors, (1069), 687 states have internal predecessors, (1069), 3 states have call successors, (3), 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-27 10:18:55,674 INFO L74 IsIncluded]: Start isIncluded. First operand 886 states. Second operand has 692 states, 687 states have (on average 1.5560407569141192) internal successors, (1069), 687 states have internal predecessors, (1069), 3 states have call successors, (3), 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-27 10:18:55,674 INFO L87 Difference]: Start difference. First operand 886 states. Second operand has 692 states, 687 states have (on average 1.5560407569141192) internal successors, (1069), 687 states have internal predecessors, (1069), 3 states have call successors, (3), 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-27 10:18:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:55,710 INFO L93 Difference]: Finished difference Result 886 states and 1337 transitions. [2022-04-27 10:18:55,710 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1337 transitions. [2022-04-27 10:18:55,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:55,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:55,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 692 states, 687 states have (on average 1.5560407569141192) internal successors, (1069), 687 states have internal predecessors, (1069), 3 states have call successors, (3), 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 886 states. [2022-04-27 10:18:55,713 INFO L87 Difference]: Start difference. First operand has 692 states, 687 states have (on average 1.5560407569141192) internal successors, (1069), 687 states have internal predecessors, (1069), 3 states have call successors, (3), 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 886 states. [2022-04-27 10:18:55,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:55,747 INFO L93 Difference]: Finished difference Result 886 states and 1337 transitions. [2022-04-27 10:18:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1337 transitions. [2022-04-27 10:18:55,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:55,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:55,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:55,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 687 states have (on average 1.5560407569141192) internal successors, (1069), 687 states have internal predecessors, (1069), 3 states have call successors, (3), 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-27 10:18:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1073 transitions. [2022-04-27 10:18:55,771 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1073 transitions. Word has length 100 [2022-04-27 10:18:55,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:55,771 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 1073 transitions. [2022-04-27 10:18:55,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1073 transitions. [2022-04-27 10:18:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 10:18:55,773 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:55,773 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:55,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 10:18:55,773 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:55,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:55,773 INFO L85 PathProgramCache]: Analyzing trace with hash 428311239, now seen corresponding path program 1 times [2022-04-27 10:18:55,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:55,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179396837] [2022-04-27 10:18:55,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:55,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:55,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:55,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {48602#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {48595#true} is VALID [2022-04-27 10:18:55,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {48595#true} assume true; {48595#true} is VALID [2022-04-27 10:18:55,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48595#true} {48595#true} #591#return; {48595#true} is VALID [2022-04-27 10:18:55,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {48595#true} call ULTIMATE.init(); {48602#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:55,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {48602#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {48595#true} is VALID [2022-04-27 10:18:55,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {48595#true} assume true; {48595#true} is VALID [2022-04-27 10:18:55,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48595#true} {48595#true} #591#return; {48595#true} is VALID [2022-04-27 10:18:55,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {48595#true} call #t~ret159 := main(); {48595#true} is VALID [2022-04-27 10:18:55,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {48595#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {48595#true} is VALID [2022-04-27 10:18:55,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {48595#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {48595#true} is VALID [2022-04-27 10:18:55,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {48595#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {48595#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {48595#true} is VALID [2022-04-27 10:18:55,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {48595#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {48595#true} is VALID [2022-04-27 10:18:55,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {48595#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48595#true} is VALID [2022-04-27 10:18:55,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {48595#true} assume !false; {48595#true} is VALID [2022-04-27 10:18:55,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {48595#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {48595#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {48595#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {48595#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {48595#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {48595#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {48595#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {48595#true} assume 4369 == #t~mem49;havoc #t~mem49; {48595#true} is VALID [2022-04-27 10:18:55,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {48595#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {48595#true} is VALID [2022-04-27 10:18:55,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {48595#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48595#true} is VALID [2022-04-27 10:18:55,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {48595#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {48595#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {48595#true} is VALID [2022-04-27 10:18:55,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {48595#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {48595#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {48595#true} is VALID [2022-04-27 10:18:55,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {48595#true} ~skip~0 := 0; {48595#true} is VALID [2022-04-27 10:18:55,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {48595#true} assume !false; {48595#true} is VALID [2022-04-27 10:18:55,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {48595#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {48595#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {48595#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {48595#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {48595#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {48595#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {48595#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {48595#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,914 INFO L290 TraceCheckUtils]: 36: Hoare triple {48595#true} assume 4384 == #t~mem50;havoc #t~mem50; {48595#true} is VALID [2022-04-27 10:18:55,914 INFO L290 TraceCheckUtils]: 37: Hoare triple {48595#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {48595#true} is VALID [2022-04-27 10:18:55,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {48595#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {48595#true} is VALID [2022-04-27 10:18:55,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {48595#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {48595#true} is VALID [2022-04-27 10:18:55,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {48595#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {48600#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:55,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {48600#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {48600#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:55,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {48600#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {48600#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:55,916 INFO L290 TraceCheckUtils]: 43: Hoare triple {48600#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {48600#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:55,916 INFO L290 TraceCheckUtils]: 44: Hoare triple {48600#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {48600#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:55,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {48600#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {48600#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:55,917 INFO L290 TraceCheckUtils]: 46: Hoare triple {48600#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {48601#(not (= 12292 |ssl3_connect_#t~mem43|))} is VALID [2022-04-27 10:18:55,917 INFO L290 TraceCheckUtils]: 47: Hoare triple {48601#(not (= 12292 |ssl3_connect_#t~mem43|))} assume 12292 == #t~mem43;havoc #t~mem43; {48596#false} is VALID [2022-04-27 10:18:55,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {48596#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {48596#false} is VALID [2022-04-27 10:18:55,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {48596#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {48596#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {48596#false} is VALID [2022-04-27 10:18:55,918 INFO L290 TraceCheckUtils]: 51: Hoare triple {48596#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,918 INFO L290 TraceCheckUtils]: 52: Hoare triple {48596#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,918 INFO L290 TraceCheckUtils]: 53: Hoare triple {48596#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {48596#false} is VALID [2022-04-27 10:18:55,918 INFO L290 TraceCheckUtils]: 54: Hoare triple {48596#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {48596#false} is VALID [2022-04-27 10:18:55,918 INFO L290 TraceCheckUtils]: 55: Hoare triple {48596#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {48596#false} is VALID [2022-04-27 10:18:55,918 INFO L290 TraceCheckUtils]: 56: Hoare triple {48596#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,918 INFO L290 TraceCheckUtils]: 57: Hoare triple {48596#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,918 INFO L290 TraceCheckUtils]: 58: Hoare triple {48596#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {48596#false} is VALID [2022-04-27 10:18:55,918 INFO L290 TraceCheckUtils]: 59: Hoare triple {48596#false} ~skip~0 := 0; {48596#false} is VALID [2022-04-27 10:18:55,918 INFO L290 TraceCheckUtils]: 60: Hoare triple {48596#false} assume !false; {48596#false} is VALID [2022-04-27 10:18:55,918 INFO L290 TraceCheckUtils]: 61: Hoare triple {48596#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,919 INFO L290 TraceCheckUtils]: 62: Hoare triple {48596#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,919 INFO L290 TraceCheckUtils]: 63: Hoare triple {48596#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,919 INFO L290 TraceCheckUtils]: 64: Hoare triple {48596#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,919 INFO L290 TraceCheckUtils]: 65: Hoare triple {48596#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,919 INFO L290 TraceCheckUtils]: 66: Hoare triple {48596#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,919 INFO L290 TraceCheckUtils]: 67: Hoare triple {48596#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,919 INFO L290 TraceCheckUtils]: 68: Hoare triple {48596#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,919 INFO L290 TraceCheckUtils]: 69: Hoare triple {48596#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,919 INFO L290 TraceCheckUtils]: 70: Hoare triple {48596#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,919 INFO L290 TraceCheckUtils]: 71: Hoare triple {48596#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,919 INFO L290 TraceCheckUtils]: 72: Hoare triple {48596#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,919 INFO L290 TraceCheckUtils]: 73: Hoare triple {48596#false} assume 4416 == #t~mem54;havoc #t~mem54; {48596#false} is VALID [2022-04-27 10:18:55,919 INFO L290 TraceCheckUtils]: 74: Hoare triple {48596#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 75: Hoare triple {48596#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 76: Hoare triple {48596#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 77: Hoare triple {48596#false} assume !(0 == ~tmp___6~0); {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 78: Hoare triple {48596#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 79: Hoare triple {48596#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 80: Hoare triple {48596#false} ~skip~0 := 0; {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 81: Hoare triple {48596#false} assume !false; {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 82: Hoare triple {48596#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 83: Hoare triple {48596#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 84: Hoare triple {48596#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 85: Hoare triple {48596#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 86: Hoare triple {48596#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 87: Hoare triple {48596#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 88: Hoare triple {48596#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,920 INFO L290 TraceCheckUtils]: 89: Hoare triple {48596#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,921 INFO L290 TraceCheckUtils]: 90: Hoare triple {48596#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,921 INFO L290 TraceCheckUtils]: 91: Hoare triple {48596#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,921 INFO L290 TraceCheckUtils]: 92: Hoare triple {48596#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,921 INFO L290 TraceCheckUtils]: 93: Hoare triple {48596#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,921 INFO L290 TraceCheckUtils]: 94: Hoare triple {48596#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,921 INFO L290 TraceCheckUtils]: 95: Hoare triple {48596#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48596#false} is VALID [2022-04-27 10:18:55,921 INFO L290 TraceCheckUtils]: 96: Hoare triple {48596#false} assume 4432 == #t~mem56;havoc #t~mem56; {48596#false} is VALID [2022-04-27 10:18:55,921 INFO L290 TraceCheckUtils]: 97: Hoare triple {48596#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {48596#false} is VALID [2022-04-27 10:18:55,921 INFO L290 TraceCheckUtils]: 98: Hoare triple {48596#false} assume 5 == ~blastFlag~0; {48596#false} is VALID [2022-04-27 10:18:55,921 INFO L290 TraceCheckUtils]: 99: Hoare triple {48596#false} assume !false; {48596#false} is VALID [2022-04-27 10:18:55,922 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 10:18:55,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:55,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179396837] [2022-04-27 10:18:55,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179396837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:55,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:55,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:55,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722473168] [2022-04-27 10:18:55,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:55,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 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 100 [2022-04-27 10:18:55,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:55,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:55,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:55,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:55,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:55,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:55,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:55,991 INFO L87 Difference]: Start difference. First operand 692 states and 1073 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:58,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:18:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:59,183 INFO L93 Difference]: Finished difference Result 1581 states and 2420 transitions. [2022-04-27 10:18:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:59,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 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 100 [2022-04-27 10:18:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-27 10:18:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-27 10:18:59,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-27 10:18:59,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:59,527 INFO L225 Difference]: With dead ends: 1581 [2022-04-27 10:18:59,527 INFO L226 Difference]: Without dead ends: 902 [2022-04-27 10:18:59,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:59,528 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 111 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:59,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 503 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 486 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 10:18:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2022-04-27 10:18:59,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 695. [2022-04-27 10:18:59,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:59,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 902 states. Second operand has 695 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 690 states have internal predecessors, (1059), 3 states have call successors, (3), 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-27 10:18:59,548 INFO L74 IsIncluded]: Start isIncluded. First operand 902 states. Second operand has 695 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 690 states have internal predecessors, (1059), 3 states have call successors, (3), 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-27 10:18:59,548 INFO L87 Difference]: Start difference. First operand 902 states. Second operand has 695 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 690 states have internal predecessors, (1059), 3 states have call successors, (3), 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-27 10:18:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:59,585 INFO L93 Difference]: Finished difference Result 902 states and 1350 transitions. [2022-04-27 10:18:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1350 transitions. [2022-04-27 10:18:59,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:59,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:59,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 695 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 690 states have internal predecessors, (1059), 3 states have call successors, (3), 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 902 states. [2022-04-27 10:18:59,587 INFO L87 Difference]: Start difference. First operand has 695 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 690 states have internal predecessors, (1059), 3 states have call successors, (3), 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 902 states. [2022-04-27 10:18:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:59,626 INFO L93 Difference]: Finished difference Result 902 states and 1350 transitions. [2022-04-27 10:18:59,626 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1350 transitions. [2022-04-27 10:18:59,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:59,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:59,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:59,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 690 states have internal predecessors, (1059), 3 states have call successors, (3), 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-27 10:18:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1063 transitions. [2022-04-27 10:18:59,650 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1063 transitions. Word has length 100 [2022-04-27 10:18:59,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:59,651 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 1063 transitions. [2022-04-27 10:18:59,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1063 transitions. [2022-04-27 10:18:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 10:18:59,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:59,652 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:59,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 10:18:59,652 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:59,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:59,653 INFO L85 PathProgramCache]: Analyzing trace with hash -852029360, now seen corresponding path program 1 times [2022-04-27 10:18:59,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:59,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204153553] [2022-04-27 10:18:59,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:59,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:59,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {52944#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {52937#true} is VALID [2022-04-27 10:18:59,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {52937#true} assume true; {52937#true} is VALID [2022-04-27 10:18:59,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52937#true} {52937#true} #591#return; {52937#true} is VALID [2022-04-27 10:18:59,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {52937#true} call ULTIMATE.init(); {52944#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:59,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {52944#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {52937#true} is VALID [2022-04-27 10:18:59,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {52937#true} assume true; {52937#true} is VALID [2022-04-27 10:18:59,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52937#true} {52937#true} #591#return; {52937#true} is VALID [2022-04-27 10:18:59,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {52937#true} call #t~ret159 := main(); {52937#true} is VALID [2022-04-27 10:18:59,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {52937#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {52937#true} is VALID [2022-04-27 10:18:59,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {52937#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {52937#true} is VALID [2022-04-27 10:18:59,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {52937#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {52937#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {52937#true} is VALID [2022-04-27 10:18:59,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {52937#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {52937#true} is VALID [2022-04-27 10:18:59,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {52937#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52937#true} is VALID [2022-04-27 10:18:59,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {52937#true} assume !false; {52937#true} is VALID [2022-04-27 10:18:59,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {52937#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {52937#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {52937#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {52937#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {52937#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {52937#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {52937#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {52937#true} assume 4369 == #t~mem49;havoc #t~mem49; {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {52937#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {52937#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {52937#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {52937#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {52937#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {52937#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {52937#true} ~skip~0 := 0; {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {52937#true} assume !false; {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {52937#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {52937#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {52937#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {52937#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {52937#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {52937#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {52937#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {52937#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {52937#true} assume 4384 == #t~mem50;havoc #t~mem50; {52937#true} is VALID [2022-04-27 10:18:59,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {52937#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {52937#true} is VALID [2022-04-27 10:18:59,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {52937#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52937#true} is VALID [2022-04-27 10:18:59,803 INFO L290 TraceCheckUtils]: 39: Hoare triple {52937#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {52937#true} is VALID [2022-04-27 10:18:59,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {52937#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:59,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:59,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:59,805 INFO L290 TraceCheckUtils]: 43: Hoare triple {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:59,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:59,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:59,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:59,807 INFO L290 TraceCheckUtils]: 47: Hoare triple {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:18:59,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {52942#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {52943#(not (= |ssl3_connect_#t~mem45| 4096))} is VALID [2022-04-27 10:18:59,808 INFO L290 TraceCheckUtils]: 49: Hoare triple {52943#(not (= |ssl3_connect_#t~mem45| 4096))} assume 4096 == #t~mem45;havoc #t~mem45; {52938#false} is VALID [2022-04-27 10:18:59,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {52938#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {52938#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52938#false} is VALID [2022-04-27 10:18:59,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {52938#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,808 INFO L290 TraceCheckUtils]: 53: Hoare triple {52938#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {52938#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {52938#false} is VALID [2022-04-27 10:18:59,808 INFO L290 TraceCheckUtils]: 55: Hoare triple {52938#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {52938#false} is VALID [2022-04-27 10:18:59,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {52938#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {52938#false} is VALID [2022-04-27 10:18:59,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {52938#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,808 INFO L290 TraceCheckUtils]: 58: Hoare triple {52938#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,808 INFO L290 TraceCheckUtils]: 59: Hoare triple {52938#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {52938#false} is VALID [2022-04-27 10:18:59,808 INFO L290 TraceCheckUtils]: 60: Hoare triple {52938#false} ~skip~0 := 0; {52938#false} is VALID [2022-04-27 10:18:59,808 INFO L290 TraceCheckUtils]: 61: Hoare triple {52938#false} assume !false; {52938#false} is VALID [2022-04-27 10:18:59,808 INFO L290 TraceCheckUtils]: 62: Hoare triple {52938#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 63: Hoare triple {52938#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 64: Hoare triple {52938#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 65: Hoare triple {52938#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 66: Hoare triple {52938#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 67: Hoare triple {52938#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 68: Hoare triple {52938#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 69: Hoare triple {52938#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 70: Hoare triple {52938#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 71: Hoare triple {52938#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 72: Hoare triple {52938#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 73: Hoare triple {52938#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 74: Hoare triple {52938#false} assume 4416 == #t~mem54;havoc #t~mem54; {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 75: Hoare triple {52938#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 76: Hoare triple {52938#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {52938#false} is VALID [2022-04-27 10:18:59,809 INFO L290 TraceCheckUtils]: 77: Hoare triple {52938#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {52938#false} is VALID [2022-04-27 10:18:59,810 INFO L290 TraceCheckUtils]: 78: Hoare triple {52938#false} assume !(0 == ~tmp___6~0); {52938#false} is VALID [2022-04-27 10:18:59,810 INFO L290 TraceCheckUtils]: 79: Hoare triple {52938#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,810 INFO L290 TraceCheckUtils]: 80: Hoare triple {52938#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {52938#false} is VALID [2022-04-27 10:18:59,810 INFO L290 TraceCheckUtils]: 81: Hoare triple {52938#false} ~skip~0 := 0; {52938#false} is VALID [2022-04-27 10:18:59,810 INFO L290 TraceCheckUtils]: 82: Hoare triple {52938#false} assume !false; {52938#false} is VALID [2022-04-27 10:18:59,810 INFO L290 TraceCheckUtils]: 83: Hoare triple {52938#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,810 INFO L290 TraceCheckUtils]: 84: Hoare triple {52938#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,810 INFO L290 TraceCheckUtils]: 85: Hoare triple {52938#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,810 INFO L290 TraceCheckUtils]: 86: Hoare triple {52938#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,810 INFO L290 TraceCheckUtils]: 87: Hoare triple {52938#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,810 INFO L290 TraceCheckUtils]: 88: Hoare triple {52938#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,810 INFO L290 TraceCheckUtils]: 89: Hoare triple {52938#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,810 INFO L290 TraceCheckUtils]: 90: Hoare triple {52938#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,810 INFO L290 TraceCheckUtils]: 91: Hoare triple {52938#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,811 INFO L290 TraceCheckUtils]: 92: Hoare triple {52938#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,811 INFO L290 TraceCheckUtils]: 93: Hoare triple {52938#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,811 INFO L290 TraceCheckUtils]: 94: Hoare triple {52938#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,811 INFO L290 TraceCheckUtils]: 95: Hoare triple {52938#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,811 INFO L290 TraceCheckUtils]: 96: Hoare triple {52938#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52938#false} is VALID [2022-04-27 10:18:59,811 INFO L290 TraceCheckUtils]: 97: Hoare triple {52938#false} assume 4432 == #t~mem56;havoc #t~mem56; {52938#false} is VALID [2022-04-27 10:18:59,811 INFO L290 TraceCheckUtils]: 98: Hoare triple {52938#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {52938#false} is VALID [2022-04-27 10:18:59,811 INFO L290 TraceCheckUtils]: 99: Hoare triple {52938#false} assume 5 == ~blastFlag~0; {52938#false} is VALID [2022-04-27 10:18:59,811 INFO L290 TraceCheckUtils]: 100: Hoare triple {52938#false} assume !false; {52938#false} is VALID [2022-04-27 10:18:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 10:18:59,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:59,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204153553] [2022-04-27 10:18:59,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204153553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:59,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:59,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:18:59,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553872031] [2022-04-27 10:18:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:59,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 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 101 [2022-04-27 10:18:59,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:59,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:59,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:59,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:18:59,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:59,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:18:59,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:59,876 INFO L87 Difference]: Start difference. First operand 695 states and 1063 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:01,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:19:02,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:02,941 INFO L93 Difference]: Finished difference Result 1566 states and 2367 transitions. [2022-04-27 10:19:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:19:02,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 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 101 [2022-04-27 10:19:02,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-27 10:19:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-27 10:19:02,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-27 10:19:03,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:03,290 INFO L225 Difference]: With dead ends: 1566 [2022-04-27 10:19:03,290 INFO L226 Difference]: Without dead ends: 887 [2022-04-27 10:19:03,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:19:03,291 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 117 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:03,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 320 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 10:19:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-04-27 10:19:03,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 695. [2022-04-27 10:19:03,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:03,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 887 states. Second operand has 695 states, 690 states have (on average 1.5115942028985507) internal successors, (1043), 690 states have internal predecessors, (1043), 3 states have call successors, (3), 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-27 10:19:03,310 INFO L74 IsIncluded]: Start isIncluded. First operand 887 states. Second operand has 695 states, 690 states have (on average 1.5115942028985507) internal successors, (1043), 690 states have internal predecessors, (1043), 3 states have call successors, (3), 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-27 10:19:03,311 INFO L87 Difference]: Start difference. First operand 887 states. Second operand has 695 states, 690 states have (on average 1.5115942028985507) internal successors, (1043), 690 states have internal predecessors, (1043), 3 states have call successors, (3), 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-27 10:19:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:03,346 INFO L93 Difference]: Finished difference Result 887 states and 1309 transitions. [2022-04-27 10:19:03,346 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1309 transitions. [2022-04-27 10:19:03,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:03,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:03,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 695 states, 690 states have (on average 1.5115942028985507) internal successors, (1043), 690 states have internal predecessors, (1043), 3 states have call successors, (3), 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 887 states. [2022-04-27 10:19:03,349 INFO L87 Difference]: Start difference. First operand has 695 states, 690 states have (on average 1.5115942028985507) internal successors, (1043), 690 states have internal predecessors, (1043), 3 states have call successors, (3), 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 887 states. [2022-04-27 10:19:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:03,381 INFO L93 Difference]: Finished difference Result 887 states and 1309 transitions. [2022-04-27 10:19:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1309 transitions. [2022-04-27 10:19:03,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:03,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:03,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:03,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 690 states have (on average 1.5115942028985507) internal successors, (1043), 690 states have internal predecessors, (1043), 3 states have call successors, (3), 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-27 10:19:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1047 transitions. [2022-04-27 10:19:03,407 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1047 transitions. Word has length 101 [2022-04-27 10:19:03,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:03,407 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 1047 transitions. [2022-04-27 10:19:03,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:03,408 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1047 transitions. [2022-04-27 10:19:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 10:19:03,409 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:03,409 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:03,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 10:19:03,409 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1276111053, now seen corresponding path program 1 times [2022-04-27 10:19:03,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:03,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41596381] [2022-04-27 10:19:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:03,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:03,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:03,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {57242#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {57235#true} is VALID [2022-04-27 10:19:03,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {57235#true} assume true; {57235#true} is VALID [2022-04-27 10:19:03,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57235#true} {57235#true} #591#return; {57235#true} is VALID [2022-04-27 10:19:03,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {57235#true} call ULTIMATE.init(); {57242#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:03,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {57242#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {57235#true} is VALID [2022-04-27 10:19:03,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {57235#true} assume true; {57235#true} is VALID [2022-04-27 10:19:03,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57235#true} {57235#true} #591#return; {57235#true} is VALID [2022-04-27 10:19:03,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {57235#true} call #t~ret159 := main(); {57235#true} is VALID [2022-04-27 10:19:03,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {57235#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {57235#true} is VALID [2022-04-27 10:19:03,543 INFO L272 TraceCheckUtils]: 6: Hoare triple {57235#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {57235#true} is VALID [2022-04-27 10:19:03,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {57235#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {57235#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {57235#true} is VALID [2022-04-27 10:19:03,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {57235#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {57235#true} is VALID [2022-04-27 10:19:03,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {57235#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {57235#true} is VALID [2022-04-27 10:19:03,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {57235#true} assume !false; {57235#true} is VALID [2022-04-27 10:19:03,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {57235#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {57235#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {57235#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {57235#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {57235#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {57235#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {57235#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {57235#true} assume 4369 == #t~mem49;havoc #t~mem49; {57235#true} is VALID [2022-04-27 10:19:03,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {57235#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {57235#true} is VALID [2022-04-27 10:19:03,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {57235#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {57235#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {57235#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {57235#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {57235#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {57235#true} ~skip~0 := 0; {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {57235#true} assume !false; {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {57235#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {57235#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {57235#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {57235#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {57235#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {57235#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {57235#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {57235#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {57235#true} assume 4384 == #t~mem50;havoc #t~mem50; {57235#true} is VALID [2022-04-27 10:19:03,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {57235#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {57235#true} is VALID [2022-04-27 10:19:03,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {57235#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {57235#true} is VALID [2022-04-27 10:19:03,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {57235#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {57235#true} is VALID [2022-04-27 10:19:03,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {57235#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:03,547 INFO L290 TraceCheckUtils]: 41: Hoare triple {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:03,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:03,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:03,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:03,549 INFO L290 TraceCheckUtils]: 45: Hoare triple {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:03,549 INFO L290 TraceCheckUtils]: 46: Hoare triple {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:03,549 INFO L290 TraceCheckUtils]: 47: Hoare triple {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:03,550 INFO L290 TraceCheckUtils]: 48: Hoare triple {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:03,550 INFO L290 TraceCheckUtils]: 49: Hoare triple {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:03,550 INFO L290 TraceCheckUtils]: 50: Hoare triple {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:03,551 INFO L290 TraceCheckUtils]: 51: Hoare triple {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:03,551 INFO L290 TraceCheckUtils]: 52: Hoare triple {57240#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57241#(= |ssl3_connect_#t~mem49| 4560)} is VALID [2022-04-27 10:19:03,551 INFO L290 TraceCheckUtils]: 53: Hoare triple {57241#(= |ssl3_connect_#t~mem49| 4560)} assume 4369 == #t~mem49;havoc #t~mem49; {57236#false} is VALID [2022-04-27 10:19:03,551 INFO L290 TraceCheckUtils]: 54: Hoare triple {57236#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 55: Hoare triple {57236#false} assume !(0 == ~blastFlag~0); {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 56: Hoare triple {57236#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 57: Hoare triple {57236#false} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 58: Hoare triple {57236#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 59: Hoare triple {57236#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 60: Hoare triple {57236#false} ~skip~0 := 0; {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {57236#false} assume !false; {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {57236#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {57236#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 64: Hoare triple {57236#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 65: Hoare triple {57236#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {57236#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 67: Hoare triple {57236#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 68: Hoare triple {57236#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,552 INFO L290 TraceCheckUtils]: 69: Hoare triple {57236#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,553 INFO L290 TraceCheckUtils]: 70: Hoare triple {57236#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,553 INFO L290 TraceCheckUtils]: 71: Hoare triple {57236#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {57236#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {57236#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,553 INFO L290 TraceCheckUtils]: 74: Hoare triple {57236#false} assume 4416 == #t~mem54;havoc #t~mem54; {57236#false} is VALID [2022-04-27 10:19:03,553 INFO L290 TraceCheckUtils]: 75: Hoare triple {57236#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {57236#false} is VALID [2022-04-27 10:19:03,553 INFO L290 TraceCheckUtils]: 76: Hoare triple {57236#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {57236#false} is VALID [2022-04-27 10:19:03,553 INFO L290 TraceCheckUtils]: 77: Hoare triple {57236#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {57236#false} is VALID [2022-04-27 10:19:03,567 INFO L290 TraceCheckUtils]: 78: Hoare triple {57236#false} assume !(0 == ~tmp___6~0); {57236#false} is VALID [2022-04-27 10:19:03,567 INFO L290 TraceCheckUtils]: 79: Hoare triple {57236#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,567 INFO L290 TraceCheckUtils]: 80: Hoare triple {57236#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {57236#false} is VALID [2022-04-27 10:19:03,568 INFO L290 TraceCheckUtils]: 81: Hoare triple {57236#false} ~skip~0 := 0; {57236#false} is VALID [2022-04-27 10:19:03,568 INFO L290 TraceCheckUtils]: 82: Hoare triple {57236#false} assume !false; {57236#false} is VALID [2022-04-27 10:19:03,568 INFO L290 TraceCheckUtils]: 83: Hoare triple {57236#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,568 INFO L290 TraceCheckUtils]: 84: Hoare triple {57236#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,568 INFO L290 TraceCheckUtils]: 85: Hoare triple {57236#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,568 INFO L290 TraceCheckUtils]: 86: Hoare triple {57236#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,568 INFO L290 TraceCheckUtils]: 87: Hoare triple {57236#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,568 INFO L290 TraceCheckUtils]: 88: Hoare triple {57236#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,568 INFO L290 TraceCheckUtils]: 89: Hoare triple {57236#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,568 INFO L290 TraceCheckUtils]: 90: Hoare triple {57236#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,568 INFO L290 TraceCheckUtils]: 91: Hoare triple {57236#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,568 INFO L290 TraceCheckUtils]: 92: Hoare triple {57236#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,568 INFO L290 TraceCheckUtils]: 93: Hoare triple {57236#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,568 INFO L290 TraceCheckUtils]: 94: Hoare triple {57236#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,569 INFO L290 TraceCheckUtils]: 95: Hoare triple {57236#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,569 INFO L290 TraceCheckUtils]: 96: Hoare triple {57236#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {57236#false} is VALID [2022-04-27 10:19:03,569 INFO L290 TraceCheckUtils]: 97: Hoare triple {57236#false} assume 4432 == #t~mem56;havoc #t~mem56; {57236#false} is VALID [2022-04-27 10:19:03,569 INFO L290 TraceCheckUtils]: 98: Hoare triple {57236#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {57236#false} is VALID [2022-04-27 10:19:03,569 INFO L290 TraceCheckUtils]: 99: Hoare triple {57236#false} assume 5 == ~blastFlag~0; {57236#false} is VALID [2022-04-27 10:19:03,569 INFO L290 TraceCheckUtils]: 100: Hoare triple {57236#false} assume !false; {57236#false} is VALID [2022-04-27 10:19:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 10:19:03,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:03,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41596381] [2022-04-27 10:19:03,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41596381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:03,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:03,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:19:03,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006896178] [2022-04-27 10:19:03,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:03,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 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 101 [2022-04-27 10:19:03,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:03,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:03,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:03,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:19:03,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:03,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:19:03,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:19:03,647 INFO L87 Difference]: Start difference. First operand 695 states and 1047 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:05,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:19:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:06,881 INFO L93 Difference]: Finished difference Result 1246 states and 1868 transitions. [2022-04-27 10:19:06,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:19:06,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 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 101 [2022-04-27 10:19:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-27 10:19:06,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-27 10:19:06,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-27 10:19:07,177 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-27 10:19:07,199 INFO L225 Difference]: With dead ends: 1246 [2022-04-27 10:19:07,199 INFO L226 Difference]: Without dead ends: 805 [2022-04-27 10:19:07,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:19:07,200 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 82 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:07,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 542 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 502 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 10:19:07,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-04-27 10:19:07,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 695. [2022-04-27 10:19:07,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:07,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 805 states. Second operand has 695 states, 690 states have (on average 1.508695652173913) internal successors, (1041), 690 states have internal predecessors, (1041), 3 states have call successors, (3), 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-27 10:19:07,226 INFO L74 IsIncluded]: Start isIncluded. First operand 805 states. Second operand has 695 states, 690 states have (on average 1.508695652173913) internal successors, (1041), 690 states have internal predecessors, (1041), 3 states have call successors, (3), 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-27 10:19:07,226 INFO L87 Difference]: Start difference. First operand 805 states. Second operand has 695 states, 690 states have (on average 1.508695652173913) internal successors, (1041), 690 states have internal predecessors, (1041), 3 states have call successors, (3), 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-27 10:19:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:07,257 INFO L93 Difference]: Finished difference Result 805 states and 1199 transitions. [2022-04-27 10:19:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1199 transitions. [2022-04-27 10:19:07,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:07,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:07,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 695 states, 690 states have (on average 1.508695652173913) internal successors, (1041), 690 states have internal predecessors, (1041), 3 states have call successors, (3), 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 805 states. [2022-04-27 10:19:07,260 INFO L87 Difference]: Start difference. First operand has 695 states, 690 states have (on average 1.508695652173913) internal successors, (1041), 690 states have internal predecessors, (1041), 3 states have call successors, (3), 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 805 states. [2022-04-27 10:19:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:07,289 INFO L93 Difference]: Finished difference Result 805 states and 1199 transitions. [2022-04-27 10:19:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1199 transitions. [2022-04-27 10:19:07,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:07,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:07,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:07,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 690 states have (on average 1.508695652173913) internal successors, (1041), 690 states have internal predecessors, (1041), 3 states have call successors, (3), 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-27 10:19:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1045 transitions. [2022-04-27 10:19:07,313 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1045 transitions. Word has length 101 [2022-04-27 10:19:07,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:07,314 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 1045 transitions. [2022-04-27 10:19:07,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1045 transitions. [2022-04-27 10:19:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 10:19:07,315 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:07,315 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:07,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 10:19:07,316 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:07,316 INFO L85 PathProgramCache]: Analyzing trace with hash 725640173, now seen corresponding path program 1 times [2022-04-27 10:19:07,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:07,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062282765] [2022-04-27 10:19:07,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:07,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:07,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:07,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {61011#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {61004#true} is VALID [2022-04-27 10:19:07,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {61004#true} assume true; {61004#true} is VALID [2022-04-27 10:19:07,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61004#true} {61004#true} #591#return; {61004#true} is VALID [2022-04-27 10:19:07,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {61004#true} call ULTIMATE.init(); {61011#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:07,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {61011#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {61004#true} is VALID [2022-04-27 10:19:07,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {61004#true} assume true; {61004#true} is VALID [2022-04-27 10:19:07,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61004#true} {61004#true} #591#return; {61004#true} is VALID [2022-04-27 10:19:07,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {61004#true} call #t~ret159 := main(); {61004#true} is VALID [2022-04-27 10:19:07,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {61004#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {61004#true} is VALID [2022-04-27 10:19:07,462 INFO L272 TraceCheckUtils]: 6: Hoare triple {61004#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {61004#true} is VALID [2022-04-27 10:19:07,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {61004#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {61004#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {61004#true} is VALID [2022-04-27 10:19:07,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {61004#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {61004#true} is VALID [2022-04-27 10:19:07,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {61004#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {61004#true} is VALID [2022-04-27 10:19:07,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {61004#true} assume !false; {61004#true} is VALID [2022-04-27 10:19:07,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {61004#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {61004#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {61004#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {61004#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {61004#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {61004#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {61004#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {61004#true} assume 4369 == #t~mem49;havoc #t~mem49; {61004#true} is VALID [2022-04-27 10:19:07,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {61004#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {61004#true} is VALID [2022-04-27 10:19:07,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {61004#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {61004#true} is VALID [2022-04-27 10:19:07,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {61004#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {61004#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {61004#true} is VALID [2022-04-27 10:19:07,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {61004#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {61004#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61004#true} is VALID [2022-04-27 10:19:07,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {61004#true} ~skip~0 := 0; {61004#true} is VALID [2022-04-27 10:19:07,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {61004#true} assume !false; {61004#true} is VALID [2022-04-27 10:19:07,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {61004#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {61004#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {61004#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {61004#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {61004#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,464 INFO L290 TraceCheckUtils]: 33: Hoare triple {61004#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,464 INFO L290 TraceCheckUtils]: 34: Hoare triple {61004#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {61004#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {61004#true} assume 4384 == #t~mem50;havoc #t~mem50; {61004#true} is VALID [2022-04-27 10:19:07,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {61004#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {61004#true} is VALID [2022-04-27 10:19:07,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {61004#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {61004#true} is VALID [2022-04-27 10:19:07,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {61004#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {61004#true} is VALID [2022-04-27 10:19:07,465 INFO L290 TraceCheckUtils]: 40: Hoare triple {61004#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,466 INFO L290 TraceCheckUtils]: 41: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,467 INFO L290 TraceCheckUtils]: 43: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,467 INFO L290 TraceCheckUtils]: 44: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,468 INFO L290 TraceCheckUtils]: 46: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,468 INFO L290 TraceCheckUtils]: 47: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,470 INFO L290 TraceCheckUtils]: 52: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,472 INFO L290 TraceCheckUtils]: 56: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,472 INFO L290 TraceCheckUtils]: 57: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,472 INFO L290 TraceCheckUtils]: 58: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,473 INFO L290 TraceCheckUtils]: 59: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,473 INFO L290 TraceCheckUtils]: 60: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,473 INFO L290 TraceCheckUtils]: 61: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,474 INFO L290 TraceCheckUtils]: 62: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,474 INFO L290 TraceCheckUtils]: 63: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,475 INFO L290 TraceCheckUtils]: 64: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,475 INFO L290 TraceCheckUtils]: 65: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,475 INFO L290 TraceCheckUtils]: 66: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,476 INFO L290 TraceCheckUtils]: 67: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,476 INFO L290 TraceCheckUtils]: 68: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,477 INFO L290 TraceCheckUtils]: 69: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,477 INFO L290 TraceCheckUtils]: 70: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 10:19:07,477 INFO L290 TraceCheckUtils]: 71: Hoare triple {61009#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {61010#(= |ssl3_connect_#t~mem68| 4560)} is VALID [2022-04-27 10:19:07,478 INFO L290 TraceCheckUtils]: 72: Hoare triple {61010#(= |ssl3_connect_#t~mem68| 4560)} assume 4512 == #t~mem68;havoc #t~mem68; {61005#false} is VALID [2022-04-27 10:19:07,478 INFO L290 TraceCheckUtils]: 73: Hoare triple {61005#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {61005#false} is VALID [2022-04-27 10:19:07,478 INFO L290 TraceCheckUtils]: 74: Hoare triple {61005#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 836 + #t~mem112.offset, 4);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 172 + #t~mem111.offset, 4);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 891 + #t~mem114.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,478 INFO L290 TraceCheckUtils]: 75: Hoare triple {61005#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 4294967296;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call write~int(0, #t~mem116.base, 168 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {61005#false} is VALID [2022-04-27 10:19:07,479 INFO L290 TraceCheckUtils]: 76: Hoare triple {61005#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {61005#false} is VALID [2022-04-27 10:19:07,479 INFO L290 TraceCheckUtils]: 77: Hoare triple {61005#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {61005#false} is VALID [2022-04-27 10:19:07,479 INFO L290 TraceCheckUtils]: 78: Hoare triple {61005#false} assume !(0 == ~tmp___8~0); {61005#false} is VALID [2022-04-27 10:19:07,479 INFO L290 TraceCheckUtils]: 79: Hoare triple {61005#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,479 INFO L290 TraceCheckUtils]: 80: Hoare triple {61005#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61005#false} is VALID [2022-04-27 10:19:07,479 INFO L290 TraceCheckUtils]: 81: Hoare triple {61005#false} ~skip~0 := 0; {61005#false} is VALID [2022-04-27 10:19:07,479 INFO L290 TraceCheckUtils]: 82: Hoare triple {61005#false} assume !false; {61005#false} is VALID [2022-04-27 10:19:07,479 INFO L290 TraceCheckUtils]: 83: Hoare triple {61005#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,479 INFO L290 TraceCheckUtils]: 84: Hoare triple {61005#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,479 INFO L290 TraceCheckUtils]: 85: Hoare triple {61005#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,480 INFO L290 TraceCheckUtils]: 86: Hoare triple {61005#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,480 INFO L290 TraceCheckUtils]: 87: Hoare triple {61005#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,480 INFO L290 TraceCheckUtils]: 88: Hoare triple {61005#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,480 INFO L290 TraceCheckUtils]: 89: Hoare triple {61005#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,480 INFO L290 TraceCheckUtils]: 90: Hoare triple {61005#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,480 INFO L290 TraceCheckUtils]: 91: Hoare triple {61005#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,480 INFO L290 TraceCheckUtils]: 92: Hoare triple {61005#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,480 INFO L290 TraceCheckUtils]: 93: Hoare triple {61005#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,480 INFO L290 TraceCheckUtils]: 94: Hoare triple {61005#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,480 INFO L290 TraceCheckUtils]: 95: Hoare triple {61005#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,480 INFO L290 TraceCheckUtils]: 96: Hoare triple {61005#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61005#false} is VALID [2022-04-27 10:19:07,480 INFO L290 TraceCheckUtils]: 97: Hoare triple {61005#false} assume 4432 == #t~mem56;havoc #t~mem56; {61005#false} is VALID [2022-04-27 10:19:07,481 INFO L290 TraceCheckUtils]: 98: Hoare triple {61005#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {61005#false} is VALID [2022-04-27 10:19:07,481 INFO L290 TraceCheckUtils]: 99: Hoare triple {61005#false} assume 5 == ~blastFlag~0; {61005#false} is VALID [2022-04-27 10:19:07,481 INFO L290 TraceCheckUtils]: 100: Hoare triple {61005#false} assume !false; {61005#false} is VALID [2022-04-27 10:19:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:19:07,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:07,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062282765] [2022-04-27 10:19:07,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062282765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:07,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:07,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:19:07,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740000836] [2022-04-27 10:19:07,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:07,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 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 101 [2022-04-27 10:19:07,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:07,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:07,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:07,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:19:07,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:07,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:19:07,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:19:07,558 INFO L87 Difference]: Start difference. First operand 695 states and 1045 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:09,586 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:19:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:10,786 INFO L93 Difference]: Finished difference Result 1484 states and 2223 transitions. [2022-04-27 10:19:10,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:19:10,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 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 101 [2022-04-27 10:19:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-04-27 10:19:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-04-27 10:19:10,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 450 transitions. [2022-04-27 10:19:11,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:11,114 INFO L225 Difference]: With dead ends: 1484 [2022-04-27 10:19:11,114 INFO L226 Difference]: Without dead ends: 805 [2022-04-27 10:19:11,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:19:11,115 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 62 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:11,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 540 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 501 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 10:19:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-04-27 10:19:11,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 721. [2022-04-27 10:19:11,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:11,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 805 states. Second operand has 721 states, 716 states have (on average 1.5125698324022345) internal successors, (1083), 716 states have internal predecessors, (1083), 3 states have call successors, (3), 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-27 10:19:11,134 INFO L74 IsIncluded]: Start isIncluded. First operand 805 states. Second operand has 721 states, 716 states have (on average 1.5125698324022345) internal successors, (1083), 716 states have internal predecessors, (1083), 3 states have call successors, (3), 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-27 10:19:11,135 INFO L87 Difference]: Start difference. First operand 805 states. Second operand has 721 states, 716 states have (on average 1.5125698324022345) internal successors, (1083), 716 states have internal predecessors, (1083), 3 states have call successors, (3), 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-27 10:19:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:11,165 INFO L93 Difference]: Finished difference Result 805 states and 1197 transitions. [2022-04-27 10:19:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1197 transitions. [2022-04-27 10:19:11,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:11,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:11,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 721 states, 716 states have (on average 1.5125698324022345) internal successors, (1083), 716 states have internal predecessors, (1083), 3 states have call successors, (3), 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 805 states. [2022-04-27 10:19:11,168 INFO L87 Difference]: Start difference. First operand has 721 states, 716 states have (on average 1.5125698324022345) internal successors, (1083), 716 states have internal predecessors, (1083), 3 states have call successors, (3), 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 805 states. [2022-04-27 10:19:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:11,198 INFO L93 Difference]: Finished difference Result 805 states and 1197 transitions. [2022-04-27 10:19:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1197 transitions. [2022-04-27 10:19:11,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:11,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:11,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:11,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 716 states have (on average 1.5125698324022345) internal successors, (1083), 716 states have internal predecessors, (1083), 3 states have call successors, (3), 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-27 10:19:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1087 transitions. [2022-04-27 10:19:11,217 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1087 transitions. Word has length 101 [2022-04-27 10:19:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:11,217 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 1087 transitions. [2022-04-27 10:19:11,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1087 transitions. [2022-04-27 10:19:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 10:19:11,218 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:11,219 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:11,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 10:19:11,219 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:11,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:11,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1316661163, now seen corresponding path program 1 times [2022-04-27 10:19:11,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:11,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528532619] [2022-04-27 10:19:11,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:11,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:11,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:11,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {65065#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {65058#true} is VALID [2022-04-27 10:19:11,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {65058#true} assume true; {65058#true} is VALID [2022-04-27 10:19:11,361 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65058#true} {65058#true} #591#return; {65058#true} is VALID [2022-04-27 10:19:11,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {65058#true} call ULTIMATE.init(); {65065#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:11,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {65065#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {65058#true} is VALID [2022-04-27 10:19:11,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {65058#true} assume true; {65058#true} is VALID [2022-04-27 10:19:11,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65058#true} {65058#true} #591#return; {65058#true} is VALID [2022-04-27 10:19:11,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {65058#true} call #t~ret159 := main(); {65058#true} is VALID [2022-04-27 10:19:11,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {65058#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {65058#true} is VALID [2022-04-27 10:19:11,362 INFO L272 TraceCheckUtils]: 6: Hoare triple {65058#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {65058#true} is VALID [2022-04-27 10:19:11,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {65058#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {65058#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {65058#true} is VALID [2022-04-27 10:19:11,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {65058#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {65058#true} is VALID [2022-04-27 10:19:11,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {65058#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {65058#true} is VALID [2022-04-27 10:19:11,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {65058#true} assume !false; {65058#true} is VALID [2022-04-27 10:19:11,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {65058#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {65058#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {65058#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {65058#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {65058#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {65058#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {65058#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {65058#true} assume 4369 == #t~mem49;havoc #t~mem49; {65058#true} is VALID [2022-04-27 10:19:11,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {65058#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {65058#true} is VALID [2022-04-27 10:19:11,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {65058#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {65058#true} is VALID [2022-04-27 10:19:11,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {65058#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {65058#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {65058#true} is VALID [2022-04-27 10:19:11,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {65058#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {65058#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {65058#true} is VALID [2022-04-27 10:19:11,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {65058#true} ~skip~0 := 0; {65058#true} is VALID [2022-04-27 10:19:11,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {65058#true} assume !false; {65058#true} is VALID [2022-04-27 10:19:11,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {65058#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {65058#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {65058#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {65058#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {65058#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {65058#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {65058#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {65058#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {65058#true} assume 4384 == #t~mem50;havoc #t~mem50; {65058#true} is VALID [2022-04-27 10:19:11,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {65058#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {65058#true} is VALID [2022-04-27 10:19:11,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {65058#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {65058#true} is VALID [2022-04-27 10:19:11,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {65058#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {65058#true} is VALID [2022-04-27 10:19:11,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {65058#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,368 INFO L290 TraceCheckUtils]: 45: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,368 INFO L290 TraceCheckUtils]: 46: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,371 INFO L290 TraceCheckUtils]: 53: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,371 INFO L290 TraceCheckUtils]: 55: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,372 INFO L290 TraceCheckUtils]: 56: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,372 INFO L290 TraceCheckUtils]: 57: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,372 INFO L290 TraceCheckUtils]: 58: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,373 INFO L290 TraceCheckUtils]: 59: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,373 INFO L290 TraceCheckUtils]: 60: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,374 INFO L290 TraceCheckUtils]: 61: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,374 INFO L290 TraceCheckUtils]: 62: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,374 INFO L290 TraceCheckUtils]: 63: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,375 INFO L290 TraceCheckUtils]: 64: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,375 INFO L290 TraceCheckUtils]: 66: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,376 INFO L290 TraceCheckUtils]: 67: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,376 INFO L290 TraceCheckUtils]: 68: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,376 INFO L290 TraceCheckUtils]: 69: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,377 INFO L290 TraceCheckUtils]: 70: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,377 INFO L290 TraceCheckUtils]: 71: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,378 INFO L290 TraceCheckUtils]: 72: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4512 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:11,378 INFO L290 TraceCheckUtils]: 73: Hoare triple {65063#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4513 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {65064#(not (= |ssl3_connect_#t~mem70| 4528))} is VALID [2022-04-27 10:19:11,378 INFO L290 TraceCheckUtils]: 74: Hoare triple {65064#(not (= |ssl3_connect_#t~mem70| 4528))} assume 4528 == #t~mem70;havoc #t~mem70; {65059#false} is VALID [2022-04-27 10:19:11,383 INFO L290 TraceCheckUtils]: 75: Hoare triple {65059#false} assume -2147483648 <= #t~nondet123 && #t~nondet123 <= 2147483647;~ret~0 := #t~nondet123;havoc #t~nondet123; {65059#false} is VALID [2022-04-27 10:19:11,384 INFO L290 TraceCheckUtils]: 76: Hoare triple {65059#false} assume !(~ret~0 <= 0);call write~int(4352, ~s.base, 52 + ~s.offset, 4);call #t~mem124.base, #t~mem124.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem125 := read~int(#t~mem124.base, #t~mem124.offset, 4);call write~int((if 0 == #t~mem125 then 0 else (if 1 == #t~mem125 then ~bitwiseAnd(#t~mem125, -5) else ~bitwiseAnd(#t~mem125, -5))), #t~mem124.base, #t~mem124.offset, 4);havoc #t~mem124.base, #t~mem124.offset;havoc #t~mem125;call #t~mem126 := read~int(~s.base, 92 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {65059#false} assume !(0 != #t~mem126);havoc #t~mem126;call #t~mem133.base, #t~mem133.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(4560, #t~mem133.base, 844 + #t~mem133.offset, 4);havoc #t~mem133.base, #t~mem133.offset; {65059#false} is VALID [2022-04-27 10:19:11,384 INFO L290 TraceCheckUtils]: 78: Hoare triple {65059#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,384 INFO L290 TraceCheckUtils]: 79: Hoare triple {65059#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,384 INFO L290 TraceCheckUtils]: 80: Hoare triple {65059#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {65059#false} is VALID [2022-04-27 10:19:11,384 INFO L290 TraceCheckUtils]: 81: Hoare triple {65059#false} ~skip~0 := 0; {65059#false} is VALID [2022-04-27 10:19:11,384 INFO L290 TraceCheckUtils]: 82: Hoare triple {65059#false} assume !false; {65059#false} is VALID [2022-04-27 10:19:11,384 INFO L290 TraceCheckUtils]: 83: Hoare triple {65059#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,385 INFO L290 TraceCheckUtils]: 84: Hoare triple {65059#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,385 INFO L290 TraceCheckUtils]: 85: Hoare triple {65059#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,385 INFO L290 TraceCheckUtils]: 86: Hoare triple {65059#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {65059#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {65059#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,385 INFO L290 TraceCheckUtils]: 89: Hoare triple {65059#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,385 INFO L290 TraceCheckUtils]: 90: Hoare triple {65059#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,385 INFO L290 TraceCheckUtils]: 91: Hoare triple {65059#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,385 INFO L290 TraceCheckUtils]: 92: Hoare triple {65059#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,385 INFO L290 TraceCheckUtils]: 93: Hoare triple {65059#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,385 INFO L290 TraceCheckUtils]: 94: Hoare triple {65059#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,385 INFO L290 TraceCheckUtils]: 95: Hoare triple {65059#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,385 INFO L290 TraceCheckUtils]: 96: Hoare triple {65059#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65059#false} is VALID [2022-04-27 10:19:11,385 INFO L290 TraceCheckUtils]: 97: Hoare triple {65059#false} assume 4432 == #t~mem56;havoc #t~mem56; {65059#false} is VALID [2022-04-27 10:19:11,386 INFO L290 TraceCheckUtils]: 98: Hoare triple {65059#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {65059#false} is VALID [2022-04-27 10:19:11,386 INFO L290 TraceCheckUtils]: 99: Hoare triple {65059#false} assume 5 == ~blastFlag~0; {65059#false} is VALID [2022-04-27 10:19:11,386 INFO L290 TraceCheckUtils]: 100: Hoare triple {65059#false} assume !false; {65059#false} is VALID [2022-04-27 10:19:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:19:11,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:11,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528532619] [2022-04-27 10:19:11,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528532619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:11,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:11,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:19:11,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980289516] [2022-04-27 10:19:11,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:11,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 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 101 [2022-04-27 10:19:11,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:11,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:11,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:11,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:19:11,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:11,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:19:11,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:19:11,467 INFO L87 Difference]: Start difference. First operand 721 states and 1087 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:13,493 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:19:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:14,487 INFO L93 Difference]: Finished difference Result 1618 states and 2415 transitions. [2022-04-27 10:19:14,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:19:14,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 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 101 [2022-04-27 10:19:14,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-27 10:19:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-27 10:19:14,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-27 10:19:14,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:14,833 INFO L225 Difference]: With dead ends: 1618 [2022-04-27 10:19:14,833 INFO L226 Difference]: Without dead ends: 913 [2022-04-27 10:19:14,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:19:14,834 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 91 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:14,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 298 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 10:19:14,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2022-04-27 10:19:14,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 754. [2022-04-27 10:19:14,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:14,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 913 states. Second operand has 754 states, 749 states have (on average 1.5300400534045393) internal successors, (1146), 749 states have internal predecessors, (1146), 3 states have call successors, (3), 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-27 10:19:14,854 INFO L74 IsIncluded]: Start isIncluded. First operand 913 states. Second operand has 754 states, 749 states have (on average 1.5300400534045393) internal successors, (1146), 749 states have internal predecessors, (1146), 3 states have call successors, (3), 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-27 10:19:14,854 INFO L87 Difference]: Start difference. First operand 913 states. Second operand has 754 states, 749 states have (on average 1.5300400534045393) internal successors, (1146), 749 states have internal predecessors, (1146), 3 states have call successors, (3), 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-27 10:19:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:14,891 INFO L93 Difference]: Finished difference Result 913 states and 1346 transitions. [2022-04-27 10:19:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1346 transitions. [2022-04-27 10:19:14,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:14,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:14,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 754 states, 749 states have (on average 1.5300400534045393) internal successors, (1146), 749 states have internal predecessors, (1146), 3 states have call successors, (3), 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 913 states. [2022-04-27 10:19:14,894 INFO L87 Difference]: Start difference. First operand has 754 states, 749 states have (on average 1.5300400534045393) internal successors, (1146), 749 states have internal predecessors, (1146), 3 states have call successors, (3), 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 913 states. [2022-04-27 10:19:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:14,923 INFO L93 Difference]: Finished difference Result 913 states and 1346 transitions. [2022-04-27 10:19:14,923 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1346 transitions. [2022-04-27 10:19:14,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:14,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:14,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:14,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 749 states have (on average 1.5300400534045393) internal successors, (1146), 749 states have internal predecessors, (1146), 3 states have call successors, (3), 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-27 10:19:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1150 transitions. [2022-04-27 10:19:14,942 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1150 transitions. Word has length 101 [2022-04-27 10:19:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:14,942 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 1150 transitions. [2022-04-27 10:19:14,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1150 transitions. [2022-04-27 10:19:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 10:19:14,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:14,943 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:14,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 10:19:14,944 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1057281585, now seen corresponding path program 1 times [2022-04-27 10:19:14,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:14,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277609224] [2022-04-27 10:19:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:15,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:15,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {69526#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {69519#true} is VALID [2022-04-27 10:19:15,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {69519#true} assume true; {69519#true} is VALID [2022-04-27 10:19:15,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69519#true} {69519#true} #591#return; {69519#true} is VALID [2022-04-27 10:19:15,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {69519#true} call ULTIMATE.init(); {69526#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:15,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {69526#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {69519#true} is VALID [2022-04-27 10:19:15,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {69519#true} assume true; {69519#true} is VALID [2022-04-27 10:19:15,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69519#true} {69519#true} #591#return; {69519#true} is VALID [2022-04-27 10:19:15,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {69519#true} call #t~ret159 := main(); {69519#true} is VALID [2022-04-27 10:19:15,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {69519#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {69519#true} is VALID [2022-04-27 10:19:15,070 INFO L272 TraceCheckUtils]: 6: Hoare triple {69519#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {69519#true} is VALID [2022-04-27 10:19:15,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {69519#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {69519#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {69519#true} is VALID [2022-04-27 10:19:15,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {69519#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {69519#true} is VALID [2022-04-27 10:19:15,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {69519#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {69519#true} is VALID [2022-04-27 10:19:15,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {69519#true} assume !false; {69519#true} is VALID [2022-04-27 10:19:15,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {69519#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {69519#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {69519#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {69519#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {69519#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {69519#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {69519#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {69519#true} assume 4369 == #t~mem49;havoc #t~mem49; {69519#true} is VALID [2022-04-27 10:19:15,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {69519#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {69519#true} is VALID [2022-04-27 10:19:15,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {69519#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {69519#true} is VALID [2022-04-27 10:19:15,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {69519#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {69519#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {69519#true} is VALID [2022-04-27 10:19:15,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {69519#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {69519#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {69519#true} is VALID [2022-04-27 10:19:15,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {69519#true} ~skip~0 := 0; {69519#true} is VALID [2022-04-27 10:19:15,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {69519#true} assume !false; {69519#true} is VALID [2022-04-27 10:19:15,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {69519#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {69519#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {69519#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {69519#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {69519#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {69519#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {69519#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {69519#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {69519#true} assume 4384 == #t~mem50;havoc #t~mem50; {69519#true} is VALID [2022-04-27 10:19:15,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {69519#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {69519#true} is VALID [2022-04-27 10:19:15,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {69519#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {69519#true} is VALID [2022-04-27 10:19:15,073 INFO L290 TraceCheckUtils]: 39: Hoare triple {69519#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {69519#true} is VALID [2022-04-27 10:19:15,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {69519#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:15,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:15,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:15,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:15,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:15,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:15,076 INFO L290 TraceCheckUtils]: 46: Hoare triple {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:15,076 INFO L290 TraceCheckUtils]: 47: Hoare triple {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:15,076 INFO L290 TraceCheckUtils]: 48: Hoare triple {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:15,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:15,077 INFO L290 TraceCheckUtils]: 50: Hoare triple {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:15,077 INFO L290 TraceCheckUtils]: 51: Hoare triple {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:15,078 INFO L290 TraceCheckUtils]: 52: Hoare triple {69524#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69525#(not (= 4369 |ssl3_connect_#t~mem49|))} is VALID [2022-04-27 10:19:15,078 INFO L290 TraceCheckUtils]: 53: Hoare triple {69525#(not (= 4369 |ssl3_connect_#t~mem49|))} assume 4369 == #t~mem49;havoc #t~mem49; {69520#false} is VALID [2022-04-27 10:19:15,078 INFO L290 TraceCheckUtils]: 54: Hoare triple {69520#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {69520#false} is VALID [2022-04-27 10:19:15,078 INFO L290 TraceCheckUtils]: 55: Hoare triple {69520#false} assume !(0 == ~blastFlag~0); {69520#false} is VALID [2022-04-27 10:19:15,078 INFO L290 TraceCheckUtils]: 56: Hoare triple {69520#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,078 INFO L290 TraceCheckUtils]: 57: Hoare triple {69520#false} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {69520#false} is VALID [2022-04-27 10:19:15,078 INFO L290 TraceCheckUtils]: 58: Hoare triple {69520#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,078 INFO L290 TraceCheckUtils]: 59: Hoare triple {69520#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {69520#false} is VALID [2022-04-27 10:19:15,078 INFO L290 TraceCheckUtils]: 60: Hoare triple {69520#false} ~skip~0 := 0; {69520#false} is VALID [2022-04-27 10:19:15,079 INFO L290 TraceCheckUtils]: 61: Hoare triple {69520#false} assume !false; {69520#false} is VALID [2022-04-27 10:19:15,079 INFO L290 TraceCheckUtils]: 62: Hoare triple {69520#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,079 INFO L290 TraceCheckUtils]: 63: Hoare triple {69520#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,079 INFO L290 TraceCheckUtils]: 64: Hoare triple {69520#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,079 INFO L290 TraceCheckUtils]: 65: Hoare triple {69520#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,079 INFO L290 TraceCheckUtils]: 66: Hoare triple {69520#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,079 INFO L290 TraceCheckUtils]: 67: Hoare triple {69520#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,079 INFO L290 TraceCheckUtils]: 68: Hoare triple {69520#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,079 INFO L290 TraceCheckUtils]: 69: Hoare triple {69520#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,079 INFO L290 TraceCheckUtils]: 70: Hoare triple {69520#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,079 INFO L290 TraceCheckUtils]: 71: Hoare triple {69520#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,079 INFO L290 TraceCheckUtils]: 72: Hoare triple {69520#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,079 INFO L290 TraceCheckUtils]: 73: Hoare triple {69520#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,079 INFO L290 TraceCheckUtils]: 74: Hoare triple {69520#false} assume 4416 == #t~mem54;havoc #t~mem54; {69520#false} is VALID [2022-04-27 10:19:15,080 INFO L290 TraceCheckUtils]: 75: Hoare triple {69520#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {69520#false} is VALID [2022-04-27 10:19:15,080 INFO L290 TraceCheckUtils]: 76: Hoare triple {69520#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {69520#false} is VALID [2022-04-27 10:19:15,080 INFO L290 TraceCheckUtils]: 77: Hoare triple {69520#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {69520#false} is VALID [2022-04-27 10:19:15,080 INFO L290 TraceCheckUtils]: 78: Hoare triple {69520#false} assume !(0 == ~tmp___6~0); {69520#false} is VALID [2022-04-27 10:19:15,080 INFO L290 TraceCheckUtils]: 79: Hoare triple {69520#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,080 INFO L290 TraceCheckUtils]: 80: Hoare triple {69520#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {69520#false} is VALID [2022-04-27 10:19:15,080 INFO L290 TraceCheckUtils]: 81: Hoare triple {69520#false} ~skip~0 := 0; {69520#false} is VALID [2022-04-27 10:19:15,080 INFO L290 TraceCheckUtils]: 82: Hoare triple {69520#false} assume !false; {69520#false} is VALID [2022-04-27 10:19:15,080 INFO L290 TraceCheckUtils]: 83: Hoare triple {69520#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,080 INFO L290 TraceCheckUtils]: 84: Hoare triple {69520#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,080 INFO L290 TraceCheckUtils]: 85: Hoare triple {69520#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,080 INFO L290 TraceCheckUtils]: 86: Hoare triple {69520#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,080 INFO L290 TraceCheckUtils]: 87: Hoare triple {69520#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,080 INFO L290 TraceCheckUtils]: 88: Hoare triple {69520#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,081 INFO L290 TraceCheckUtils]: 89: Hoare triple {69520#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,081 INFO L290 TraceCheckUtils]: 90: Hoare triple {69520#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,081 INFO L290 TraceCheckUtils]: 91: Hoare triple {69520#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,081 INFO L290 TraceCheckUtils]: 92: Hoare triple {69520#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,081 INFO L290 TraceCheckUtils]: 93: Hoare triple {69520#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,081 INFO L290 TraceCheckUtils]: 94: Hoare triple {69520#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,081 INFO L290 TraceCheckUtils]: 95: Hoare triple {69520#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,081 INFO L290 TraceCheckUtils]: 96: Hoare triple {69520#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69520#false} is VALID [2022-04-27 10:19:15,081 INFO L290 TraceCheckUtils]: 97: Hoare triple {69520#false} assume 4432 == #t~mem56;havoc #t~mem56; {69520#false} is VALID [2022-04-27 10:19:15,081 INFO L290 TraceCheckUtils]: 98: Hoare triple {69520#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {69520#false} is VALID [2022-04-27 10:19:15,081 INFO L290 TraceCheckUtils]: 99: Hoare triple {69520#false} assume 5 == ~blastFlag~0; {69520#false} is VALID [2022-04-27 10:19:15,081 INFO L290 TraceCheckUtils]: 100: Hoare triple {69520#false} assume !false; {69520#false} is VALID [2022-04-27 10:19:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 10:19:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:15,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277609224] [2022-04-27 10:19:15,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277609224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:15,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:15,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:19:15,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436429604] [2022-04-27 10:19:15,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:15,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 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 101 [2022-04-27 10:19:15,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:15,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:15,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:15,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:19:15,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:19:15,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:19:15,145 INFO L87 Difference]: Start difference. First operand 754 states and 1150 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:17,170 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:19:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:18,135 INFO L93 Difference]: Finished difference Result 1447 states and 2183 transitions. [2022-04-27 10:19:18,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:19:18,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 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 101 [2022-04-27 10:19:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-27 10:19:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-27 10:19:18,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 470 transitions. [2022-04-27 10:19:18,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:18,478 INFO L225 Difference]: With dead ends: 1447 [2022-04-27 10:19:18,479 INFO L226 Difference]: Without dead ends: 971 [2022-04-27 10:19:18,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:19:18,480 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 108 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:18,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 330 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 402 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 10:19:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-04-27 10:19:18,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 757. [2022-04-27 10:19:18,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:18,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 971 states. Second operand has 757 states, 752 states have (on average 1.5172872340425532) internal successors, (1141), 752 states have internal predecessors, (1141), 3 states have call successors, (3), 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-27 10:19:18,513 INFO L74 IsIncluded]: Start isIncluded. First operand 971 states. Second operand has 757 states, 752 states have (on average 1.5172872340425532) internal successors, (1141), 752 states have internal predecessors, (1141), 3 states have call successors, (3), 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-27 10:19:18,514 INFO L87 Difference]: Start difference. First operand 971 states. Second operand has 757 states, 752 states have (on average 1.5172872340425532) internal successors, (1141), 752 states have internal predecessors, (1141), 3 states have call successors, (3), 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-27 10:19:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:18,555 INFO L93 Difference]: Finished difference Result 971 states and 1443 transitions. [2022-04-27 10:19:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1443 transitions. [2022-04-27 10:19:18,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:18,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:18,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 757 states, 752 states have (on average 1.5172872340425532) internal successors, (1141), 752 states have internal predecessors, (1141), 3 states have call successors, (3), 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 971 states. [2022-04-27 10:19:18,557 INFO L87 Difference]: Start difference. First operand has 757 states, 752 states have (on average 1.5172872340425532) internal successors, (1141), 752 states have internal predecessors, (1141), 3 states have call successors, (3), 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 971 states. [2022-04-27 10:19:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:18,599 INFO L93 Difference]: Finished difference Result 971 states and 1443 transitions. [2022-04-27 10:19:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1443 transitions. [2022-04-27 10:19:18,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:18,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:18,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:18,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 752 states have (on average 1.5172872340425532) internal successors, (1141), 752 states have internal predecessors, (1141), 3 states have call successors, (3), 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-27 10:19:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1145 transitions. [2022-04-27 10:19:18,625 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1145 transitions. Word has length 101 [2022-04-27 10:19:18,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:18,625 INFO L495 AbstractCegarLoop]: Abstraction has 757 states and 1145 transitions. [2022-04-27 10:19:18,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1145 transitions. [2022-04-27 10:19:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-27 10:19:18,626 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:18,626 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:18,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 10:19:18,626 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:18,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:18,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1200804144, now seen corresponding path program 1 times [2022-04-27 10:19:18,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:18,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951235722] [2022-04-27 10:19:18,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:18,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:18,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:18,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {73910#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {73904#true} is VALID [2022-04-27 10:19:18,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {73904#true} assume true; {73904#true} is VALID [2022-04-27 10:19:18,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73904#true} {73904#true} #591#return; {73904#true} is VALID [2022-04-27 10:19:18,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {73904#true} call ULTIMATE.init(); {73910#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:18,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {73910#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {73904#true} is VALID [2022-04-27 10:19:18,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {73904#true} assume true; {73904#true} is VALID [2022-04-27 10:19:18,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73904#true} {73904#true} #591#return; {73904#true} is VALID [2022-04-27 10:19:18,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {73904#true} call #t~ret159 := main(); {73904#true} is VALID [2022-04-27 10:19:18,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {73904#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {73904#true} is VALID [2022-04-27 10:19:18,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {73904#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {73904#true} is VALID [2022-04-27 10:19:18,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {73904#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {73904#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {73904#true} is VALID [2022-04-27 10:19:18,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {73904#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {73904#true} is VALID [2022-04-27 10:19:18,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {73904#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {73904#true} is VALID [2022-04-27 10:19:18,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {73904#true} assume !false; {73904#true} is VALID [2022-04-27 10:19:18,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {73904#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {73904#true} assume 12292 == #t~mem43;havoc #t~mem43; {73904#true} is VALID [2022-04-27 10:19:18,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {73904#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {73904#true} is VALID [2022-04-27 10:19:18,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {73904#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {73904#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {73904#true} is VALID [2022-04-27 10:19:18,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {73904#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {73904#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {73904#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {73904#true} is VALID [2022-04-27 10:19:18,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {73904#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {73904#true} is VALID [2022-04-27 10:19:18,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {73904#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {73904#true} is VALID [2022-04-27 10:19:18,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {73904#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {73904#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {73904#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {73904#true} ~skip~0 := 0; {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {73904#true} assume !false; {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {73904#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {73904#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {73904#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {73904#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {73904#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {73904#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {73904#true} assume 4368 == #t~mem48;havoc #t~mem48; {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {73904#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {73904#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 36: Hoare triple {73904#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 37: Hoare triple {73904#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {73904#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {73904#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {73904#true} is VALID [2022-04-27 10:19:18,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {73904#true} ~skip~0 := 0; {73904#true} is VALID [2022-04-27 10:19:18,787 INFO L290 TraceCheckUtils]: 41: Hoare triple {73904#true} assume !false; {73904#true} is VALID [2022-04-27 10:19:18,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {73904#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,787 INFO L290 TraceCheckUtils]: 43: Hoare triple {73904#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,787 INFO L290 TraceCheckUtils]: 44: Hoare triple {73904#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,787 INFO L290 TraceCheckUtils]: 45: Hoare triple {73904#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,787 INFO L290 TraceCheckUtils]: 46: Hoare triple {73904#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,787 INFO L290 TraceCheckUtils]: 47: Hoare triple {73904#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {73904#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {73904#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73904#true} is VALID [2022-04-27 10:19:18,787 INFO L290 TraceCheckUtils]: 50: Hoare triple {73904#true} assume 4384 == #t~mem50;havoc #t~mem50; {73904#true} is VALID [2022-04-27 10:19:18,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {73904#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {73904#true} is VALID [2022-04-27 10:19:18,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {73904#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,788 INFO L290 TraceCheckUtils]: 54: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,789 INFO L290 TraceCheckUtils]: 55: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,789 INFO L290 TraceCheckUtils]: 56: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,789 INFO L290 TraceCheckUtils]: 57: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,789 INFO L290 TraceCheckUtils]: 58: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,790 INFO L290 TraceCheckUtils]: 59: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,791 INFO L290 TraceCheckUtils]: 62: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,791 INFO L290 TraceCheckUtils]: 63: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,791 INFO L290 TraceCheckUtils]: 64: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume 20480 == #t~mem46;havoc #t~mem46; {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,792 INFO L290 TraceCheckUtils]: 65: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,792 INFO L290 TraceCheckUtils]: 66: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,792 INFO L290 TraceCheckUtils]: 67: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,792 INFO L290 TraceCheckUtils]: 68: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,793 INFO L290 TraceCheckUtils]: 69: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,793 INFO L290 TraceCheckUtils]: 70: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,793 INFO L290 TraceCheckUtils]: 71: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,794 INFO L290 TraceCheckUtils]: 72: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,794 INFO L290 TraceCheckUtils]: 73: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,794 INFO L290 TraceCheckUtils]: 74: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,795 INFO L290 TraceCheckUtils]: 75: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,795 INFO L290 TraceCheckUtils]: 76: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,795 INFO L290 TraceCheckUtils]: 77: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,795 INFO L290 TraceCheckUtils]: 78: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,796 INFO L290 TraceCheckUtils]: 79: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,796 INFO L290 TraceCheckUtils]: 81: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,797 INFO L290 TraceCheckUtils]: 82: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,797 INFO L290 TraceCheckUtils]: 83: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,797 INFO L290 TraceCheckUtils]: 84: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,797 INFO L290 TraceCheckUtils]: 85: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,798 INFO L290 TraceCheckUtils]: 86: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,798 INFO L290 TraceCheckUtils]: 87: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,798 INFO L290 TraceCheckUtils]: 88: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,799 INFO L290 TraceCheckUtils]: 89: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem54;havoc #t~mem54; {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,799 INFO L290 TraceCheckUtils]: 90: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {73909#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:18,799 INFO L290 TraceCheckUtils]: 91: Hoare triple {73909#(= 2 ssl3_connect_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {73905#false} is VALID [2022-04-27 10:19:18,799 INFO L290 TraceCheckUtils]: 92: Hoare triple {73905#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {73905#false} is VALID [2022-04-27 10:19:18,799 INFO L290 TraceCheckUtils]: 93: Hoare triple {73905#false} assume !(0 == ~tmp___6~0); {73905#false} is VALID [2022-04-27 10:19:18,800 INFO L290 TraceCheckUtils]: 94: Hoare triple {73905#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,800 INFO L290 TraceCheckUtils]: 95: Hoare triple {73905#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {73905#false} is VALID [2022-04-27 10:19:18,800 INFO L290 TraceCheckUtils]: 96: Hoare triple {73905#false} ~skip~0 := 0; {73905#false} is VALID [2022-04-27 10:19:18,800 INFO L290 TraceCheckUtils]: 97: Hoare triple {73905#false} assume !false; {73905#false} is VALID [2022-04-27 10:19:18,800 INFO L290 TraceCheckUtils]: 98: Hoare triple {73905#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,800 INFO L290 TraceCheckUtils]: 99: Hoare triple {73905#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,800 INFO L290 TraceCheckUtils]: 100: Hoare triple {73905#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,800 INFO L290 TraceCheckUtils]: 101: Hoare triple {73905#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,800 INFO L290 TraceCheckUtils]: 102: Hoare triple {73905#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,800 INFO L290 TraceCheckUtils]: 103: Hoare triple {73905#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,800 INFO L290 TraceCheckUtils]: 104: Hoare triple {73905#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,800 INFO L290 TraceCheckUtils]: 105: Hoare triple {73905#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,800 INFO L290 TraceCheckUtils]: 106: Hoare triple {73905#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,800 INFO L290 TraceCheckUtils]: 107: Hoare triple {73905#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,801 INFO L290 TraceCheckUtils]: 108: Hoare triple {73905#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,801 INFO L290 TraceCheckUtils]: 109: Hoare triple {73905#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,801 INFO L290 TraceCheckUtils]: 110: Hoare triple {73905#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,801 INFO L290 TraceCheckUtils]: 111: Hoare triple {73905#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73905#false} is VALID [2022-04-27 10:19:18,801 INFO L290 TraceCheckUtils]: 112: Hoare triple {73905#false} assume 4432 == #t~mem56;havoc #t~mem56; {73905#false} is VALID [2022-04-27 10:19:18,801 INFO L290 TraceCheckUtils]: 113: Hoare triple {73905#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {73905#false} is VALID [2022-04-27 10:19:18,801 INFO L290 TraceCheckUtils]: 114: Hoare triple {73905#false} assume 5 == ~blastFlag~0; {73905#false} is VALID [2022-04-27 10:19:18,801 INFO L290 TraceCheckUtils]: 115: Hoare triple {73905#false} assume !false; {73905#false} is VALID [2022-04-27 10:19:18,801 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 10:19:18,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:18,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951235722] [2022-04-27 10:19:18,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951235722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:18,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:18,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:19:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363150464] [2022-04-27 10:19:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:18,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 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 116 [2022-04-27 10:19:18,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:18,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:18,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:18,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:19:18,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:18,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:19:18,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:19:18,883 INFO L87 Difference]: Start difference. First operand 757 states and 1145 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:20,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:19:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:21,909 INFO L93 Difference]: Finished difference Result 1499 states and 2277 transitions. [2022-04-27 10:19:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:19:21,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 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 116 [2022-04-27 10:19:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-27 10:19:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-27 10:19:21,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 495 transitions. [2022-04-27 10:19:22,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:22,264 INFO L225 Difference]: With dead ends: 1499 [2022-04-27 10:19:22,264 INFO L226 Difference]: Without dead ends: 1023 [2022-04-27 10:19:22,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:19:22,265 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 121 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:22,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 483 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 10:19:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2022-04-27 10:19:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2022-04-27 10:19:22,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:22,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1023 states. Second operand has 1023 states, 1018 states have (on average 1.5157170923379175) internal successors, (1543), 1018 states have internal predecessors, (1543), 3 states have call successors, (3), 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-27 10:19:22,289 INFO L74 IsIncluded]: Start isIncluded. First operand 1023 states. Second operand has 1023 states, 1018 states have (on average 1.5157170923379175) internal successors, (1543), 1018 states have internal predecessors, (1543), 3 states have call successors, (3), 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-27 10:19:22,289 INFO L87 Difference]: Start difference. First operand 1023 states. Second operand has 1023 states, 1018 states have (on average 1.5157170923379175) internal successors, (1543), 1018 states have internal predecessors, (1543), 3 states have call successors, (3), 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-27 10:19:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:22,333 INFO L93 Difference]: Finished difference Result 1023 states and 1547 transitions. [2022-04-27 10:19:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1547 transitions. [2022-04-27 10:19:22,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:22,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:22,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 1023 states, 1018 states have (on average 1.5157170923379175) internal successors, (1543), 1018 states have internal predecessors, (1543), 3 states have call successors, (3), 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 1023 states. [2022-04-27 10:19:22,337 INFO L87 Difference]: Start difference. First operand has 1023 states, 1018 states have (on average 1.5157170923379175) internal successors, (1543), 1018 states have internal predecessors, (1543), 3 states have call successors, (3), 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 1023 states. [2022-04-27 10:19:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:22,377 INFO L93 Difference]: Finished difference Result 1023 states and 1547 transitions. [2022-04-27 10:19:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1547 transitions. [2022-04-27 10:19:22,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:22,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:22,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:22,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1018 states have (on average 1.5157170923379175) internal successors, (1543), 1018 states have internal predecessors, (1543), 3 states have call successors, (3), 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-27 10:19:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1547 transitions. [2022-04-27 10:19:22,410 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1547 transitions. Word has length 116 [2022-04-27 10:19:22,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:22,410 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1547 transitions. [2022-04-27 10:19:22,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1547 transitions. [2022-04-27 10:19:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-27 10:19:22,411 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:22,411 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:22,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 10:19:22,411 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:22,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 1 times [2022-04-27 10:19:22,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:22,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619459304] [2022-04-27 10:19:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:22,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:22,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:22,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {78716#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {78710#true} is VALID [2022-04-27 10:19:22,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {78710#true} assume true; {78710#true} is VALID [2022-04-27 10:19:22,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78710#true} {78710#true} #591#return; {78710#true} is VALID [2022-04-27 10:19:22,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {78710#true} call ULTIMATE.init(); {78716#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:22,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {78716#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {78710#true} is VALID [2022-04-27 10:19:22,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {78710#true} assume true; {78710#true} is VALID [2022-04-27 10:19:22,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78710#true} {78710#true} #591#return; {78710#true} is VALID [2022-04-27 10:19:22,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {78710#true} call #t~ret159 := main(); {78710#true} is VALID [2022-04-27 10:19:22,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {78710#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {78710#true} is VALID [2022-04-27 10:19:22,571 INFO L272 TraceCheckUtils]: 6: Hoare triple {78710#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {78710#true} is VALID [2022-04-27 10:19:22,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {78710#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {78710#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {78710#true} is VALID [2022-04-27 10:19:22,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {78710#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {78710#true} is VALID [2022-04-27 10:19:22,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {78710#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {78710#true} is VALID [2022-04-27 10:19:22,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {78710#true} assume !false; {78710#true} is VALID [2022-04-27 10:19:22,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {78710#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {78710#true} assume 12292 == #t~mem43;havoc #t~mem43; {78710#true} is VALID [2022-04-27 10:19:22,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {78710#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {78710#true} is VALID [2022-04-27 10:19:22,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {78710#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {78710#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {78710#true} is VALID [2022-04-27 10:19:22,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {78710#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {78710#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {78710#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {78710#true} is VALID [2022-04-27 10:19:22,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {78710#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {78710#true} is VALID [2022-04-27 10:19:22,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {78710#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {78710#true} is VALID [2022-04-27 10:19:22,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {78710#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {78710#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {78710#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78710#true} is VALID [2022-04-27 10:19:22,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {78710#true} ~skip~0 := 0; {78710#true} is VALID [2022-04-27 10:19:22,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {78710#true} assume !false; {78710#true} is VALID [2022-04-27 10:19:22,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {78710#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {78710#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {78710#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {78710#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {78710#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {78710#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {78710#true} assume 4368 == #t~mem48;havoc #t~mem48; {78710#true} is VALID [2022-04-27 10:19:22,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {78710#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {78710#true} is VALID [2022-04-27 10:19:22,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {78710#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {78710#true} is VALID [2022-04-27 10:19:22,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {78710#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {78710#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {78710#true} is VALID [2022-04-27 10:19:22,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {78710#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {78710#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78710#true} is VALID [2022-04-27 10:19:22,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {78710#true} ~skip~0 := 0; {78710#true} is VALID [2022-04-27 10:19:22,574 INFO L290 TraceCheckUtils]: 41: Hoare triple {78710#true} assume !false; {78710#true} is VALID [2022-04-27 10:19:22,574 INFO L290 TraceCheckUtils]: 42: Hoare triple {78710#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {78710#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {78710#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,574 INFO L290 TraceCheckUtils]: 45: Hoare triple {78710#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,574 INFO L290 TraceCheckUtils]: 46: Hoare triple {78710#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,574 INFO L290 TraceCheckUtils]: 47: Hoare triple {78710#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,574 INFO L290 TraceCheckUtils]: 48: Hoare triple {78710#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,575 INFO L290 TraceCheckUtils]: 49: Hoare triple {78710#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,575 INFO L290 TraceCheckUtils]: 50: Hoare triple {78710#true} assume 4384 == #t~mem50;havoc #t~mem50; {78710#true} is VALID [2022-04-27 10:19:22,575 INFO L290 TraceCheckUtils]: 51: Hoare triple {78710#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {78710#true} is VALID [2022-04-27 10:19:22,575 INFO L290 TraceCheckUtils]: 52: Hoare triple {78710#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {78710#true} is VALID [2022-04-27 10:19:22,575 INFO L290 TraceCheckUtils]: 53: Hoare triple {78710#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {78710#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,575 INFO L290 TraceCheckUtils]: 55: Hoare triple {78710#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,575 INFO L290 TraceCheckUtils]: 56: Hoare triple {78710#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,575 INFO L290 TraceCheckUtils]: 57: Hoare triple {78710#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78710#true} is VALID [2022-04-27 10:19:22,575 INFO L290 TraceCheckUtils]: 58: Hoare triple {78710#true} ~skip~0 := 0; {78710#true} is VALID [2022-04-27 10:19:22,575 INFO L290 TraceCheckUtils]: 59: Hoare triple {78710#true} assume !false; {78710#true} is VALID [2022-04-27 10:19:22,575 INFO L290 TraceCheckUtils]: 60: Hoare triple {78710#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,575 INFO L290 TraceCheckUtils]: 61: Hoare triple {78710#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,575 INFO L290 TraceCheckUtils]: 62: Hoare triple {78710#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,576 INFO L290 TraceCheckUtils]: 63: Hoare triple {78710#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,576 INFO L290 TraceCheckUtils]: 64: Hoare triple {78710#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,576 INFO L290 TraceCheckUtils]: 65: Hoare triple {78710#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,576 INFO L290 TraceCheckUtils]: 66: Hoare triple {78710#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,576 INFO L290 TraceCheckUtils]: 67: Hoare triple {78710#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,576 INFO L290 TraceCheckUtils]: 68: Hoare triple {78710#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,576 INFO L290 TraceCheckUtils]: 69: Hoare triple {78710#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,576 INFO L290 TraceCheckUtils]: 70: Hoare triple {78710#true} assume 4400 == #t~mem52;havoc #t~mem52; {78710#true} is VALID [2022-04-27 10:19:22,576 INFO L290 TraceCheckUtils]: 71: Hoare triple {78710#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,576 INFO L290 TraceCheckUtils]: 72: Hoare triple {78710#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {78710#true} is VALID [2022-04-27 10:19:22,576 INFO L290 TraceCheckUtils]: 73: Hoare triple {78710#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {78710#true} is VALID [2022-04-27 10:19:22,576 INFO L290 TraceCheckUtils]: 74: Hoare triple {78710#true} assume !(~ret~0 <= 0); {78710#true} is VALID [2022-04-27 10:19:22,577 INFO L290 TraceCheckUtils]: 75: Hoare triple {78710#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,577 INFO L290 TraceCheckUtils]: 76: Hoare triple {78710#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,577 INFO L290 TraceCheckUtils]: 77: Hoare triple {78710#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78710#true} is VALID [2022-04-27 10:19:22,577 INFO L290 TraceCheckUtils]: 78: Hoare triple {78710#true} ~skip~0 := 0; {78710#true} is VALID [2022-04-27 10:19:22,577 INFO L290 TraceCheckUtils]: 79: Hoare triple {78710#true} assume !false; {78710#true} is VALID [2022-04-27 10:19:22,577 INFO L290 TraceCheckUtils]: 80: Hoare triple {78710#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,577 INFO L290 TraceCheckUtils]: 81: Hoare triple {78710#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,577 INFO L290 TraceCheckUtils]: 82: Hoare triple {78710#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,577 INFO L290 TraceCheckUtils]: 83: Hoare triple {78710#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,577 INFO L290 TraceCheckUtils]: 84: Hoare triple {78710#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,577 INFO L290 TraceCheckUtils]: 85: Hoare triple {78710#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,577 INFO L290 TraceCheckUtils]: 86: Hoare triple {78710#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,577 INFO L290 TraceCheckUtils]: 87: Hoare triple {78710#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,578 INFO L290 TraceCheckUtils]: 88: Hoare triple {78710#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,578 INFO L290 TraceCheckUtils]: 89: Hoare triple {78710#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,578 INFO L290 TraceCheckUtils]: 90: Hoare triple {78710#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,578 INFO L290 TraceCheckUtils]: 91: Hoare triple {78710#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78710#true} is VALID [2022-04-27 10:19:22,578 INFO L290 TraceCheckUtils]: 92: Hoare triple {78710#true} assume 4416 == #t~mem54;havoc #t~mem54; {78710#true} is VALID [2022-04-27 10:19:22,578 INFO L290 TraceCheckUtils]: 93: Hoare triple {78710#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {78710#true} is VALID [2022-04-27 10:19:22,578 INFO L290 TraceCheckUtils]: 94: Hoare triple {78710#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,578 INFO L290 TraceCheckUtils]: 95: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,579 INFO L290 TraceCheckUtils]: 96: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,579 INFO L290 TraceCheckUtils]: 97: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,579 INFO L290 TraceCheckUtils]: 98: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,580 INFO L290 TraceCheckUtils]: 99: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,581 INFO L290 TraceCheckUtils]: 100: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !false; {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,582 INFO L290 TraceCheckUtils]: 101: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,582 INFO L290 TraceCheckUtils]: 102: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,582 INFO L290 TraceCheckUtils]: 103: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,583 INFO L290 TraceCheckUtils]: 104: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,583 INFO L290 TraceCheckUtils]: 105: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,583 INFO L290 TraceCheckUtils]: 106: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,583 INFO L290 TraceCheckUtils]: 107: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,584 INFO L290 TraceCheckUtils]: 108: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,584 INFO L290 TraceCheckUtils]: 109: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,584 INFO L290 TraceCheckUtils]: 110: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,585 INFO L290 TraceCheckUtils]: 111: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,585 INFO L290 TraceCheckUtils]: 112: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,585 INFO L290 TraceCheckUtils]: 113: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,585 INFO L290 TraceCheckUtils]: 114: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,586 INFO L290 TraceCheckUtils]: 115: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem56;havoc #t~mem56; {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,586 INFO L290 TraceCheckUtils]: 116: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {78715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-27 10:19:22,586 INFO L290 TraceCheckUtils]: 117: Hoare triple {78715#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {78711#false} is VALID [2022-04-27 10:19:22,586 INFO L290 TraceCheckUtils]: 118: Hoare triple {78711#false} assume !false; {78711#false} is VALID [2022-04-27 10:19:22,587 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-27 10:19:22,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:22,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619459304] [2022-04-27 10:19:22,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619459304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:22,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:22,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:19:22,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658275289] [2022-04-27 10:19:22,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:22,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 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 119 [2022-04-27 10:19:22,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:22,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:22,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:22,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:19:22,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:22,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:19:22,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:19:22,654 INFO L87 Difference]: Start difference. First operand 1023 states and 1547 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:24,670 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-27 10:19:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:25,629 INFO L93 Difference]: Finished difference Result 2031 states and 3079 transitions. [2022-04-27 10:19:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:19:25,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 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 119 [2022-04-27 10:19:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-27 10:19:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-27 10:19:25,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 493 transitions. [2022-04-27 10:19:25,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:26,016 INFO L225 Difference]: With dead ends: 2031 [2022-04-27 10:19:26,016 INFO L226 Difference]: Without dead ends: 1289 [2022-04-27 10:19:26,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:19:26,017 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 127 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:26,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 482 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 10:19:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2022-04-27 10:19:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1287. [2022-04-27 10:19:26,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:26,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1289 states. Second operand has 1287 states, 1282 states have (on average 1.5148205928237128) internal successors, (1942), 1282 states have internal predecessors, (1942), 3 states have call successors, (3), 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-27 10:19:26,042 INFO L74 IsIncluded]: Start isIncluded. First operand 1289 states. Second operand has 1287 states, 1282 states have (on average 1.5148205928237128) internal successors, (1942), 1282 states have internal predecessors, (1942), 3 states have call successors, (3), 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-27 10:19:26,043 INFO L87 Difference]: Start difference. First operand 1289 states. Second operand has 1287 states, 1282 states have (on average 1.5148205928237128) internal successors, (1942), 1282 states have internal predecessors, (1942), 3 states have call successors, (3), 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-27 10:19:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:26,086 INFO L93 Difference]: Finished difference Result 1289 states and 1947 transitions. [2022-04-27 10:19:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1947 transitions. [2022-04-27 10:19:26,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:26,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:26,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 1287 states, 1282 states have (on average 1.5148205928237128) internal successors, (1942), 1282 states have internal predecessors, (1942), 3 states have call successors, (3), 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 1289 states. [2022-04-27 10:19:26,089 INFO L87 Difference]: Start difference. First operand has 1287 states, 1282 states have (on average 1.5148205928237128) internal successors, (1942), 1282 states have internal predecessors, (1942), 3 states have call successors, (3), 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 1289 states. [2022-04-27 10:19:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:26,132 INFO L93 Difference]: Finished difference Result 1289 states and 1947 transitions. [2022-04-27 10:19:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1947 transitions. [2022-04-27 10:19:26,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:26,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:26,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:26,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1282 states have (on average 1.5148205928237128) internal successors, (1942), 1282 states have internal predecessors, (1942), 3 states have call successors, (3), 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-27 10:19:26,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1946 transitions. [2022-04-27 10:19:26,180 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1946 transitions. Word has length 119 [2022-04-27 10:19:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:26,180 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1946 transitions. [2022-04-27 10:19:26,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1946 transitions. [2022-04-27 10:19:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-27 10:19:26,182 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:26,182 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:26,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 10:19:26,182 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:26,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:26,182 INFO L85 PathProgramCache]: Analyzing trace with hash -676421700, now seen corresponding path program 1 times [2022-04-27 10:19:26,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:26,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207919394] [2022-04-27 10:19:26,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:26,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:26,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:26,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {84917#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {84911#true} is VALID [2022-04-27 10:19:26,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {84911#true} assume true; {84911#true} is VALID [2022-04-27 10:19:26,334 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84911#true} {84911#true} #591#return; {84911#true} is VALID [2022-04-27 10:19:26,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {84911#true} call ULTIMATE.init(); {84917#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:26,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {84917#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {84911#true} is VALID [2022-04-27 10:19:26,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {84911#true} assume true; {84911#true} is VALID [2022-04-27 10:19:26,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84911#true} {84911#true} #591#return; {84911#true} is VALID [2022-04-27 10:19:26,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {84911#true} call #t~ret159 := main(); {84911#true} is VALID [2022-04-27 10:19:26,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {84911#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {84911#true} is VALID [2022-04-27 10:19:26,335 INFO L272 TraceCheckUtils]: 6: Hoare triple {84911#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {84911#true} is VALID [2022-04-27 10:19:26,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {84911#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {84911#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {84911#true} is VALID [2022-04-27 10:19:26,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {84911#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {84911#true} is VALID [2022-04-27 10:19:26,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {84911#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {84911#true} is VALID [2022-04-27 10:19:26,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {84911#true} assume !false; {84911#true} is VALID [2022-04-27 10:19:26,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {84911#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {84911#true} assume 12292 == #t~mem43;havoc #t~mem43; {84911#true} is VALID [2022-04-27 10:19:26,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {84911#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {84911#true} is VALID [2022-04-27 10:19:26,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {84911#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {84911#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {84911#true} is VALID [2022-04-27 10:19:26,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {84911#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {84911#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {84911#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {84911#true} is VALID [2022-04-27 10:19:26,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {84911#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {84911#true} is VALID [2022-04-27 10:19:26,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {84911#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {84911#true} is VALID [2022-04-27 10:19:26,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {84911#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {84911#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {84911#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {84911#true} is VALID [2022-04-27 10:19:26,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {84911#true} ~skip~0 := 0; {84911#true} is VALID [2022-04-27 10:19:26,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {84911#true} assume !false; {84911#true} is VALID [2022-04-27 10:19:26,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {84911#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {84911#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {84911#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {84911#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {84911#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {84911#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {84911#true} assume 4368 == #t~mem48;havoc #t~mem48; {84911#true} is VALID [2022-04-27 10:19:26,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {84911#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {84911#true} is VALID [2022-04-27 10:19:26,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {84911#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {84911#true} is VALID [2022-04-27 10:19:26,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {84911#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {84911#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {84911#true} is VALID [2022-04-27 10:19:26,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {84911#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {84911#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {84911#true} is VALID [2022-04-27 10:19:26,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {84911#true} ~skip~0 := 0; {84911#true} is VALID [2022-04-27 10:19:26,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {84911#true} assume !false; {84911#true} is VALID [2022-04-27 10:19:26,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {84911#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {84911#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {84911#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {84911#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,338 INFO L290 TraceCheckUtils]: 46: Hoare triple {84911#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,338 INFO L290 TraceCheckUtils]: 47: Hoare triple {84911#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,338 INFO L290 TraceCheckUtils]: 48: Hoare triple {84911#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {84911#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,338 INFO L290 TraceCheckUtils]: 50: Hoare triple {84911#true} assume 4384 == #t~mem50;havoc #t~mem50; {84911#true} is VALID [2022-04-27 10:19:26,338 INFO L290 TraceCheckUtils]: 51: Hoare triple {84911#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {84911#true} is VALID [2022-04-27 10:19:26,338 INFO L290 TraceCheckUtils]: 52: Hoare triple {84911#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {84911#true} is VALID [2022-04-27 10:19:26,338 INFO L290 TraceCheckUtils]: 53: Hoare triple {84911#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,338 INFO L290 TraceCheckUtils]: 54: Hoare triple {84911#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,338 INFO L290 TraceCheckUtils]: 55: Hoare triple {84911#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 56: Hoare triple {84911#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {84911#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {84911#true} ~skip~0 := 0; {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 59: Hoare triple {84911#true} assume !false; {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 60: Hoare triple {84911#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {84911#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 62: Hoare triple {84911#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 63: Hoare triple {84911#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 64: Hoare triple {84911#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 65: Hoare triple {84911#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 66: Hoare triple {84911#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 67: Hoare triple {84911#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 68: Hoare triple {84911#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 69: Hoare triple {84911#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,339 INFO L290 TraceCheckUtils]: 70: Hoare triple {84911#true} assume 4400 == #t~mem52;havoc #t~mem52; {84911#true} is VALID [2022-04-27 10:19:26,340 INFO L290 TraceCheckUtils]: 71: Hoare triple {84911#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {84911#true} is VALID [2022-04-27 10:19:26,340 INFO L290 TraceCheckUtils]: 72: Hoare triple {84911#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {84911#true} is VALID [2022-04-27 10:19:26,340 INFO L290 TraceCheckUtils]: 73: Hoare triple {84911#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,340 INFO L290 TraceCheckUtils]: 74: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,341 INFO L290 TraceCheckUtils]: 75: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,341 INFO L290 TraceCheckUtils]: 76: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,341 INFO L290 TraceCheckUtils]: 77: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,341 INFO L290 TraceCheckUtils]: 78: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,342 INFO L290 TraceCheckUtils]: 79: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,342 INFO L290 TraceCheckUtils]: 80: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,342 INFO L290 TraceCheckUtils]: 81: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,343 INFO L290 TraceCheckUtils]: 82: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,343 INFO L290 TraceCheckUtils]: 83: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,343 INFO L290 TraceCheckUtils]: 84: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,343 INFO L290 TraceCheckUtils]: 85: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,344 INFO L290 TraceCheckUtils]: 86: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,344 INFO L290 TraceCheckUtils]: 87: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,344 INFO L290 TraceCheckUtils]: 88: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,344 INFO L290 TraceCheckUtils]: 89: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,345 INFO L290 TraceCheckUtils]: 90: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,345 INFO L290 TraceCheckUtils]: 91: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,345 INFO L290 TraceCheckUtils]: 92: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem54;havoc #t~mem54; {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,346 INFO L290 TraceCheckUtils]: 93: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {84916#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 10:19:26,346 INFO L290 TraceCheckUtils]: 94: Hoare triple {84916#(= 3 ssl3_connect_~blastFlag~0)} assume !(3 == ~blastFlag~0); {84912#false} is VALID [2022-04-27 10:19:26,346 INFO L290 TraceCheckUtils]: 95: Hoare triple {84912#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {84912#false} is VALID [2022-04-27 10:19:26,346 INFO L290 TraceCheckUtils]: 96: Hoare triple {84912#false} assume !(0 == ~tmp___6~0); {84912#false} is VALID [2022-04-27 10:19:26,346 INFO L290 TraceCheckUtils]: 97: Hoare triple {84912#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,346 INFO L290 TraceCheckUtils]: 98: Hoare triple {84912#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {84912#false} is VALID [2022-04-27 10:19:26,346 INFO L290 TraceCheckUtils]: 99: Hoare triple {84912#false} ~skip~0 := 0; {84912#false} is VALID [2022-04-27 10:19:26,346 INFO L290 TraceCheckUtils]: 100: Hoare triple {84912#false} assume !false; {84912#false} is VALID [2022-04-27 10:19:26,346 INFO L290 TraceCheckUtils]: 101: Hoare triple {84912#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,347 INFO L290 TraceCheckUtils]: 102: Hoare triple {84912#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,347 INFO L290 TraceCheckUtils]: 103: Hoare triple {84912#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,347 INFO L290 TraceCheckUtils]: 104: Hoare triple {84912#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,347 INFO L290 TraceCheckUtils]: 105: Hoare triple {84912#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,347 INFO L290 TraceCheckUtils]: 106: Hoare triple {84912#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,347 INFO L290 TraceCheckUtils]: 107: Hoare triple {84912#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,347 INFO L290 TraceCheckUtils]: 108: Hoare triple {84912#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,347 INFO L290 TraceCheckUtils]: 109: Hoare triple {84912#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,347 INFO L290 TraceCheckUtils]: 110: Hoare triple {84912#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,347 INFO L290 TraceCheckUtils]: 111: Hoare triple {84912#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,347 INFO L290 TraceCheckUtils]: 112: Hoare triple {84912#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,347 INFO L290 TraceCheckUtils]: 113: Hoare triple {84912#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,347 INFO L290 TraceCheckUtils]: 114: Hoare triple {84912#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84912#false} is VALID [2022-04-27 10:19:26,347 INFO L290 TraceCheckUtils]: 115: Hoare triple {84912#false} assume 4432 == #t~mem56;havoc #t~mem56; {84912#false} is VALID [2022-04-27 10:19:26,348 INFO L290 TraceCheckUtils]: 116: Hoare triple {84912#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {84912#false} is VALID [2022-04-27 10:19:26,348 INFO L290 TraceCheckUtils]: 117: Hoare triple {84912#false} assume 5 == ~blastFlag~0; {84912#false} is VALID [2022-04-27 10:19:26,348 INFO L290 TraceCheckUtils]: 118: Hoare triple {84912#false} assume !false; {84912#false} is VALID [2022-04-27 10:19:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 10:19:26,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:26,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207919394] [2022-04-27 10:19:26,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207919394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:26,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:26,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:19:26,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399598786] [2022-04-27 10:19:26,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:26,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 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 119 [2022-04-27 10:19:26,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:26,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:26,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:26,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:19:26,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:26,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:19:26,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:19:26,437 INFO L87 Difference]: Start difference. First operand 1287 states and 1946 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:28,460 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 10:19:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:29,455 INFO L93 Difference]: Finished difference Result 2267 states and 3431 transitions. [2022-04-27 10:19:29,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:19:29,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 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 119 [2022-04-27 10:19:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-27 10:19:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-27 10:19:29,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 492 transitions. [2022-04-27 10:19:29,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:29,836 INFO L225 Difference]: With dead ends: 2267 [2022-04-27 10:19:29,836 INFO L226 Difference]: Without dead ends: 1261 [2022-04-27 10:19:29,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:19:29,837 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 130 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:29,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 481 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 340 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 10:19:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-04-27 10:19:29,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1261. [2022-04-27 10:19:29,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:29,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1261 states. Second operand has 1261 states, 1256 states have (on average 1.5095541401273886) internal successors, (1896), 1256 states have internal predecessors, (1896), 3 states have call successors, (3), 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-27 10:19:29,861 INFO L74 IsIncluded]: Start isIncluded. First operand 1261 states. Second operand has 1261 states, 1256 states have (on average 1.5095541401273886) internal successors, (1896), 1256 states have internal predecessors, (1896), 3 states have call successors, (3), 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-27 10:19:29,862 INFO L87 Difference]: Start difference. First operand 1261 states. Second operand has 1261 states, 1256 states have (on average 1.5095541401273886) internal successors, (1896), 1256 states have internal predecessors, (1896), 3 states have call successors, (3), 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-27 10:19:29,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:29,926 INFO L93 Difference]: Finished difference Result 1261 states and 1900 transitions. [2022-04-27 10:19:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1900 transitions. [2022-04-27 10:19:29,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:29,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:29,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 1261 states, 1256 states have (on average 1.5095541401273886) internal successors, (1896), 1256 states have internal predecessors, (1896), 3 states have call successors, (3), 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 1261 states. [2022-04-27 10:19:29,930 INFO L87 Difference]: Start difference. First operand has 1261 states, 1256 states have (on average 1.5095541401273886) internal successors, (1896), 1256 states have internal predecessors, (1896), 3 states have call successors, (3), 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 1261 states. [2022-04-27 10:19:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:29,996 INFO L93 Difference]: Finished difference Result 1261 states and 1900 transitions. [2022-04-27 10:19:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1900 transitions. [2022-04-27 10:19:29,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:29,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:29,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:29,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1256 states have (on average 1.5095541401273886) internal successors, (1896), 1256 states have internal predecessors, (1896), 3 states have call successors, (3), 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-27 10:19:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1900 transitions. [2022-04-27 10:19:30,056 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1900 transitions. Word has length 119 [2022-04-27 10:19:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:30,057 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1900 transitions. [2022-04-27 10:19:30,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1900 transitions. [2022-04-27 10:19:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-27 10:19:30,058 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:30,058 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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] [2022-04-27 10:19:30,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 10:19:30,058 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:30,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1107867599, now seen corresponding path program 1 times [2022-04-27 10:19:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:30,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742270109] [2022-04-27 10:19:30,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:30,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:30,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:30,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {91292#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {91285#true} is VALID [2022-04-27 10:19:30,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {91285#true} assume true; {91285#true} is VALID [2022-04-27 10:19:30,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91285#true} {91285#true} #591#return; {91285#true} is VALID [2022-04-27 10:19:30,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {91285#true} call ULTIMATE.init(); {91292#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:30,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {91292#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {91285#true} is VALID [2022-04-27 10:19:30,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {91285#true} assume true; {91285#true} is VALID [2022-04-27 10:19:30,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91285#true} {91285#true} #591#return; {91285#true} is VALID [2022-04-27 10:19:30,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {91285#true} call #t~ret159 := main(); {91285#true} is VALID [2022-04-27 10:19:30,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {91285#true} havoc ~s~0.base, ~s~0.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {91285#true} is VALID [2022-04-27 10:19:30,221 INFO L272 TraceCheckUtils]: 6: Hoare triple {91285#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {91285#true} is VALID [2022-04-27 10:19:30,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {91285#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {91285#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {91285#true} is VALID [2022-04-27 10:19:30,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {91285#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {91285#true} is VALID [2022-04-27 10:19:30,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {91285#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {91285#true} is VALID [2022-04-27 10:19:30,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {91285#true} assume !false; {91285#true} is VALID [2022-04-27 10:19:30,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {91285#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {91285#true} assume 12292 == #t~mem43;havoc #t~mem43; {91285#true} is VALID [2022-04-27 10:19:30,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {91285#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {91285#true} is VALID [2022-04-27 10:19:30,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {91285#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {91285#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {91285#true} is VALID [2022-04-27 10:19:30,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {91285#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {91285#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {91285#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {91285#true} is VALID [2022-04-27 10:19:30,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {91285#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {91285#true} is VALID [2022-04-27 10:19:30,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {91285#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {91285#true} is VALID [2022-04-27 10:19:30,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {91285#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {91285#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {91285#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {91285#true} is VALID [2022-04-27 10:19:30,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {91285#true} ~skip~0 := 0; {91285#true} is VALID [2022-04-27 10:19:30,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {91285#true} assume !false; {91285#true} is VALID [2022-04-27 10:19:30,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {91285#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {91285#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {91285#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {91285#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {91285#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {91285#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {91285#true} assume 4368 == #t~mem48;havoc #t~mem48; {91285#true} is VALID [2022-04-27 10:19:30,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {91285#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {91285#true} is VALID [2022-04-27 10:19:30,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {91285#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {91285#true} is VALID [2022-04-27 10:19:30,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {91285#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {91285#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {91285#true} is VALID [2022-04-27 10:19:30,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {91285#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {91285#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {91285#true} is VALID [2022-04-27 10:19:30,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {91285#true} ~skip~0 := 0; {91285#true} is VALID [2022-04-27 10:19:30,223 INFO L290 TraceCheckUtils]: 41: Hoare triple {91285#true} assume !false; {91285#true} is VALID [2022-04-27 10:19:30,223 INFO L290 TraceCheckUtils]: 42: Hoare triple {91285#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,223 INFO L290 TraceCheckUtils]: 43: Hoare triple {91285#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,223 INFO L290 TraceCheckUtils]: 44: Hoare triple {91285#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {91285#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {91285#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,224 INFO L290 TraceCheckUtils]: 47: Hoare triple {91285#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {91285#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {91285#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,224 INFO L290 TraceCheckUtils]: 50: Hoare triple {91285#true} assume 4384 == #t~mem50;havoc #t~mem50; {91285#true} is VALID [2022-04-27 10:19:30,224 INFO L290 TraceCheckUtils]: 51: Hoare triple {91285#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {91285#true} is VALID [2022-04-27 10:19:30,224 INFO L290 TraceCheckUtils]: 52: Hoare triple {91285#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {91285#true} is VALID [2022-04-27 10:19:30,224 INFO L290 TraceCheckUtils]: 53: Hoare triple {91285#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {91285#true} is VALID [2022-04-27 10:19:30,225 INFO L290 TraceCheckUtils]: 54: Hoare triple {91285#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,226 INFO L290 TraceCheckUtils]: 55: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,226 INFO L290 TraceCheckUtils]: 56: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,226 INFO L290 TraceCheckUtils]: 57: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,227 INFO L290 TraceCheckUtils]: 58: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,227 INFO L290 TraceCheckUtils]: 59: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,227 INFO L290 TraceCheckUtils]: 60: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,227 INFO L290 TraceCheckUtils]: 61: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,228 INFO L290 TraceCheckUtils]: 62: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,228 INFO L290 TraceCheckUtils]: 63: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,228 INFO L290 TraceCheckUtils]: 64: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,229 INFO L290 TraceCheckUtils]: 65: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,229 INFO L290 TraceCheckUtils]: 66: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,229 INFO L290 TraceCheckUtils]: 67: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,230 INFO L290 TraceCheckUtils]: 68: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 10:19:30,230 INFO L290 TraceCheckUtils]: 69: Hoare triple {91290#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {91291#(not (= |ssl3_connect_#t~mem52| 4400))} is VALID [2022-04-27 10:19:30,230 INFO L290 TraceCheckUtils]: 70: Hoare triple {91291#(not (= |ssl3_connect_#t~mem52| 4400))} assume 4400 == #t~mem52;havoc #t~mem52; {91286#false} is VALID [2022-04-27 10:19:30,230 INFO L290 TraceCheckUtils]: 71: Hoare triple {91286#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,231 INFO L290 TraceCheckUtils]: 72: Hoare triple {91286#false} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {91286#false} is VALID [2022-04-27 10:19:30,231 INFO L290 TraceCheckUtils]: 73: Hoare triple {91286#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {91286#false} is VALID [2022-04-27 10:19:30,231 INFO L290 TraceCheckUtils]: 74: Hoare triple {91286#false} assume !(~ret~0 <= 0); {91286#false} is VALID [2022-04-27 10:19:30,231 INFO L290 TraceCheckUtils]: 75: Hoare triple {91286#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,231 INFO L290 TraceCheckUtils]: 76: Hoare triple {91286#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,231 INFO L290 TraceCheckUtils]: 77: Hoare triple {91286#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {91286#false} is VALID [2022-04-27 10:19:30,231 INFO L290 TraceCheckUtils]: 78: Hoare triple {91286#false} ~skip~0 := 0; {91286#false} is VALID [2022-04-27 10:19:30,231 INFO L290 TraceCheckUtils]: 79: Hoare triple {91286#false} assume !false; {91286#false} is VALID [2022-04-27 10:19:30,231 INFO L290 TraceCheckUtils]: 80: Hoare triple {91286#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,231 INFO L290 TraceCheckUtils]: 81: Hoare triple {91286#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,231 INFO L290 TraceCheckUtils]: 82: Hoare triple {91286#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,231 INFO L290 TraceCheckUtils]: 83: Hoare triple {91286#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,232 INFO L290 TraceCheckUtils]: 84: Hoare triple {91286#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,232 INFO L290 TraceCheckUtils]: 85: Hoare triple {91286#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,232 INFO L290 TraceCheckUtils]: 86: Hoare triple {91286#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,232 INFO L290 TraceCheckUtils]: 87: Hoare triple {91286#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,232 INFO L290 TraceCheckUtils]: 88: Hoare triple {91286#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,232 INFO L290 TraceCheckUtils]: 89: Hoare triple {91286#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,232 INFO L290 TraceCheckUtils]: 90: Hoare triple {91286#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,232 INFO L290 TraceCheckUtils]: 91: Hoare triple {91286#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,232 INFO L290 TraceCheckUtils]: 92: Hoare triple {91286#false} assume 4416 == #t~mem54;havoc #t~mem54; {91286#false} is VALID [2022-04-27 10:19:30,232 INFO L290 TraceCheckUtils]: 93: Hoare triple {91286#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {91286#false} is VALID [2022-04-27 10:19:30,232 INFO L290 TraceCheckUtils]: 94: Hoare triple {91286#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {91286#false} is VALID [2022-04-27 10:19:30,233 INFO L290 TraceCheckUtils]: 95: Hoare triple {91286#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {91286#false} is VALID [2022-04-27 10:19:30,233 INFO L290 TraceCheckUtils]: 96: Hoare triple {91286#false} assume !(0 == ~tmp___6~0); {91286#false} is VALID [2022-04-27 10:19:30,233 INFO L290 TraceCheckUtils]: 97: Hoare triple {91286#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,233 INFO L290 TraceCheckUtils]: 98: Hoare triple {91286#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {91286#false} is VALID [2022-04-27 10:19:30,233 INFO L290 TraceCheckUtils]: 99: Hoare triple {91286#false} ~skip~0 := 0; {91286#false} is VALID [2022-04-27 10:19:30,233 INFO L290 TraceCheckUtils]: 100: Hoare triple {91286#false} assume !false; {91286#false} is VALID [2022-04-27 10:19:30,233 INFO L290 TraceCheckUtils]: 101: Hoare triple {91286#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,233 INFO L290 TraceCheckUtils]: 102: Hoare triple {91286#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,233 INFO L290 TraceCheckUtils]: 103: Hoare triple {91286#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,233 INFO L290 TraceCheckUtils]: 104: Hoare triple {91286#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,233 INFO L290 TraceCheckUtils]: 105: Hoare triple {91286#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,233 INFO L290 TraceCheckUtils]: 106: Hoare triple {91286#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,234 INFO L290 TraceCheckUtils]: 107: Hoare triple {91286#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,234 INFO L290 TraceCheckUtils]: 108: Hoare triple {91286#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,234 INFO L290 TraceCheckUtils]: 109: Hoare triple {91286#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,234 INFO L290 TraceCheckUtils]: 110: Hoare triple {91286#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,234 INFO L290 TraceCheckUtils]: 111: Hoare triple {91286#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,234 INFO L290 TraceCheckUtils]: 112: Hoare triple {91286#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,234 INFO L290 TraceCheckUtils]: 113: Hoare triple {91286#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,234 INFO L290 TraceCheckUtils]: 114: Hoare triple {91286#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,234 INFO L290 TraceCheckUtils]: 115: Hoare triple {91286#false} assume 4432 == #t~mem56;havoc #t~mem56; {91286#false} is VALID [2022-04-27 10:19:30,234 INFO L290 TraceCheckUtils]: 116: Hoare triple {91286#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {91286#false} is VALID [2022-04-27 10:19:30,234 INFO L290 TraceCheckUtils]: 117: Hoare triple {91286#false} assume !(5 == ~blastFlag~0); {91286#false} is VALID [2022-04-27 10:19:30,234 INFO L290 TraceCheckUtils]: 118: Hoare triple {91286#false} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,234 INFO L290 TraceCheckUtils]: 119: Hoare triple {91286#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,235 INFO L290 TraceCheckUtils]: 120: Hoare triple {91286#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {91286#false} is VALID [2022-04-27 10:19:30,235 INFO L290 TraceCheckUtils]: 121: Hoare triple {91286#false} ~skip~0 := 0; {91286#false} is VALID [2022-04-27 10:19:30,235 INFO L290 TraceCheckUtils]: 122: Hoare triple {91286#false} assume !false; {91286#false} is VALID [2022-04-27 10:19:30,235 INFO L290 TraceCheckUtils]: 123: Hoare triple {91286#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,235 INFO L290 TraceCheckUtils]: 124: Hoare triple {91286#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,235 INFO L290 TraceCheckUtils]: 125: Hoare triple {91286#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,235 INFO L290 TraceCheckUtils]: 126: Hoare triple {91286#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,235 INFO L290 TraceCheckUtils]: 127: Hoare triple {91286#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,235 INFO L290 TraceCheckUtils]: 128: Hoare triple {91286#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,235 INFO L290 TraceCheckUtils]: 129: Hoare triple {91286#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,235 INFO L290 TraceCheckUtils]: 130: Hoare triple {91286#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,235 INFO L290 TraceCheckUtils]: 131: Hoare triple {91286#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,236 INFO L290 TraceCheckUtils]: 132: Hoare triple {91286#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,236 INFO L290 TraceCheckUtils]: 133: Hoare triple {91286#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,236 INFO L290 TraceCheckUtils]: 134: Hoare triple {91286#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,236 INFO L290 TraceCheckUtils]: 135: Hoare triple {91286#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,236 INFO L290 TraceCheckUtils]: 136: Hoare triple {91286#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,236 INFO L290 TraceCheckUtils]: 137: Hoare triple {91286#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,236 INFO L290 TraceCheckUtils]: 138: Hoare triple {91286#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {91286#false} is VALID [2022-04-27 10:19:30,236 INFO L290 TraceCheckUtils]: 139: Hoare triple {91286#false} assume 4448 == #t~mem58;havoc #t~mem58; {91286#false} is VALID [2022-04-27 10:19:30,236 INFO L290 TraceCheckUtils]: 140: Hoare triple {91286#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {91286#false} is VALID [2022-04-27 10:19:30,236 INFO L290 TraceCheckUtils]: 141: Hoare triple {91286#false} assume 4 == ~blastFlag~0; {91286#false} is VALID [2022-04-27 10:19:30,236 INFO L290 TraceCheckUtils]: 142: Hoare triple {91286#false} assume !false; {91286#false} is VALID [2022-04-27 10:19:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-27 10:19:30,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:30,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742270109] [2022-04-27 10:19:30,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742270109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:30,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:30,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:19:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34592036] [2022-04-27 10:19:30,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:30,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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 143 [2022-04-27 10:19:30,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:30,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:30,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:30,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:19:30,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:30,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:19:30,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:19:30,322 INFO L87 Difference]: Start difference. First operand 1261 states and 1900 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:32,343 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-27 10:19:33,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:33,464 INFO L93 Difference]: Finished difference Result 2764 states and 4089 transitions. [2022-04-27 10:19:33,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:19:33,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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 143 [2022-04-27 10:19:33,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-27 10:19:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-27 10:19:33,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-27 10:19:33,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:33,865 INFO L225 Difference]: With dead ends: 2764 [2022-04-27 10:19:33,865 INFO L226 Difference]: Without dead ends: 1519 [2022-04-27 10:19:33,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:19:33,866 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 107 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:33,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 295 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 392 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 10:19:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2022-04-27 10:19:33,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1261. [2022-04-27 10:19:33,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:33,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1519 states. Second operand has 1261 states, 1256 states have (on average 1.4952229299363058) internal successors, (1878), 1256 states have internal predecessors, (1878), 3 states have call successors, (3), 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-27 10:19:33,891 INFO L74 IsIncluded]: Start isIncluded. First operand 1519 states. Second operand has 1261 states, 1256 states have (on average 1.4952229299363058) internal successors, (1878), 1256 states have internal predecessors, (1878), 3 states have call successors, (3), 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-27 10:19:33,892 INFO L87 Difference]: Start difference. First operand 1519 states. Second operand has 1261 states, 1256 states have (on average 1.4952229299363058) internal successors, (1878), 1256 states have internal predecessors, (1878), 3 states have call successors, (3), 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-27 10:19:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:33,985 INFO L93 Difference]: Finished difference Result 1519 states and 2192 transitions. [2022-04-27 10:19:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2192 transitions. [2022-04-27 10:19:33,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:33,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:33,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 1261 states, 1256 states have (on average 1.4952229299363058) internal successors, (1878), 1256 states have internal predecessors, (1878), 3 states have call successors, (3), 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 1519 states. [2022-04-27 10:19:33,989 INFO L87 Difference]: Start difference. First operand has 1261 states, 1256 states have (on average 1.4952229299363058) internal successors, (1878), 1256 states have internal predecessors, (1878), 3 states have call successors, (3), 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 1519 states. [2022-04-27 10:19:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:34,062 INFO L93 Difference]: Finished difference Result 1519 states and 2192 transitions. [2022-04-27 10:19:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2192 transitions. [2022-04-27 10:19:34,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:34,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:34,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:34,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1256 states have (on average 1.4952229299363058) internal successors, (1878), 1256 states have internal predecessors, (1878), 3 states have call successors, (3), 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-27 10:19:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1882 transitions. [2022-04-27 10:19:34,109 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1882 transitions. Word has length 143 [2022-04-27 10:19:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:34,109 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1882 transitions. [2022-04-27 10:19:34,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1882 transitions. [2022-04-27 10:19:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-27 10:19:34,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:34,110 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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] [2022-04-27 10:19:34,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 10:19:34,111 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:34,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:34,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 1 times [2022-04-27 10:19:34,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:34,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314150443] [2022-04-27 10:19:34,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:34,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:19:34,983 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 10:19:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:19:35,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 10:19:35,663 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 10:19:35,664 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:19:35,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 10:19:35,668 INFO L356 BasicCegarLoop]: Path program 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] [2022-04-27 10:19:35,671 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:19:35,793 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:19:35,793 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 10:19:35,793 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-27 10:19:35,793 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:19:35,793 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:19:35,793 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-27 10:19:35,793 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 10:19:35,793 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-27 10:19:35,793 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-27 10:19:35,793 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-27 10:19:35,793 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L1123 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L1123 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L1084 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L1084 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L1668 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L1668 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L1049 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L1049 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2022-04-27 10:19:35,794 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1126-2 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1126 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1126 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1084-1 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1668-1 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1052 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1052 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1049-2 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1052-1 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1134 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1134 has no Hoare annotation [2022-04-27 10:19:35,795 WARN L170 areAnnotationChecker]: L1143-1 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1143-1 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1143-1 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1054 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1054 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1648 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1144 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1054-1 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1652 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1652 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1652-2 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1147 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1149 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1149 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-27 10:19:35,796 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1257-2 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1269-2 has no Hoare annotation [2022-04-27 10:19:35,797 WARN L170 areAnnotationChecker]: L1303 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1303 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1282 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1282 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1303-2 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1303-2 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1289 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1289 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1315 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1315 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1324 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1324 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1581 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1324-2 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1324-2 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1177 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-27 10:19:35,798 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1343 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1343 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1618 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1618 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1617-1 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1334-2 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1343-2 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1347 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1347 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1183 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1619 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1619 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1347-2 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1347-2 has no Hoare annotation [2022-04-27 10:19:35,799 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1621 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1621 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1619-2 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1619-2 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1630 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1630 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1377 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1377 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-27 10:19:35,800 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1195 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1425 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1425 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1413-2 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-27 10:19:35,801 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1442 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1442 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1442-2 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-27 10:19:35,802 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1473 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1473 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1473-2 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1479 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1479 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1503 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1503 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1237 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-27 10:19:35,803 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1486 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1486 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1503-1 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1520 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1520 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1525 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1525 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1525-2 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1538 has no Hoare annotation [2022-04-27 10:19:35,804 WARN L170 areAnnotationChecker]: L1538 has no Hoare annotation [2022-04-27 10:19:35,805 WARN L170 areAnnotationChecker]: L1534-2 has no Hoare annotation [2022-04-27 10:19:35,805 WARN L170 areAnnotationChecker]: L1551 has no Hoare annotation [2022-04-27 10:19:35,805 WARN L170 areAnnotationChecker]: L1551 has no Hoare annotation [2022-04-27 10:19:35,805 WARN L170 areAnnotationChecker]: L1551-2 has no Hoare annotation [2022-04-27 10:19:35,805 WARN L170 areAnnotationChecker]: L1556 has no Hoare annotation [2022-04-27 10:19:35,806 WARN L170 areAnnotationChecker]: L1556 has no Hoare annotation [2022-04-27 10:19:35,806 WARN L170 areAnnotationChecker]: L1556-2 has no Hoare annotation [2022-04-27 10:19:35,806 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-27 10:19:35,806 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-27 10:19:35,806 WARN L170 areAnnotationChecker]: L1563-2 has no Hoare annotation [2022-04-27 10:19:35,806 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-27 10:19:35,806 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-27 10:19:35,806 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:19:35,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:19:35 BoogieIcfgContainer [2022-04-27 10:19:35,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:19:35,808 INFO L158 Benchmark]: Toolchain (without parser) took 108483.37ms. Allocated memory was 183.5MB in the beginning and 270.5MB in the end (delta: 87.0MB). Free memory was 123.0MB in the beginning and 131.5MB in the end (delta: -8.5MB). Peak memory consumption was 140.3MB. Max. memory is 8.0GB. [2022-04-27 10:19:35,808 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 183.5MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:19:35,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.57ms. Allocated memory was 183.5MB in the beginning and 270.5MB in the end (delta: 87.0MB). Free memory was 122.9MB in the beginning and 218.8MB in the end (delta: -95.9MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-04-27 10:19:35,811 INFO L158 Benchmark]: Boogie Preprocessor took 115.87ms. Allocated memory is still 270.5MB. Free memory was 218.8MB in the beginning and 209.4MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 10:19:35,811 INFO L158 Benchmark]: RCFGBuilder took 2784.31ms. Allocated memory is still 270.5MB. Free memory was 209.4MB in the beginning and 109.8MB in the end (delta: 99.6MB). Peak memory consumption was 99.6MB. Max. memory is 8.0GB. [2022-04-27 10:19:35,812 INFO L158 Benchmark]: TraceAbstraction took 105028.72ms. Allocated memory is still 270.5MB. Free memory was 109.2MB in the beginning and 131.5MB in the end (delta: -22.2MB). Peak memory consumption was 39.7MB. Max. memory is 8.0GB. [2022-04-27 10:19:35,818 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.36ms. Allocated memory is still 183.5MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 544.57ms. Allocated memory was 183.5MB in the beginning and 270.5MB in the end (delta: 87.0MB). Free memory was 122.9MB in the beginning and 218.8MB in the end (delta: -95.9MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 115.87ms. Allocated memory is still 270.5MB. Free memory was 218.8MB in the beginning and 209.4MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2784.31ms. Allocated memory is still 270.5MB. Free memory was 209.4MB in the beginning and 109.8MB in the end (delta: 99.6MB). Peak memory consumption was 99.6MB. Max. memory is 8.0GB. * TraceAbstraction took 105028.72ms. Allocated memory is still 270.5MB. Free memory was 109.2MB in the beginning and 131.5MB in the end (delta: -22.2MB). Peak memory consumption was 39.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1658]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1343. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967300, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={4:0}] [L1065] SSL *s ; [L1069] s = malloc (sizeof (SSL)) [L1070] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] EXPR s->s3 [L1071] s->s3->flags = __VERIFIER_nondet_long() [L1072] EXPR s->s3 [L1072] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1073] EXPR s->s3 [L1073] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1074] EXPR s->s3 [L1074] EXPR (s->s3)->tmp.new_cipher [L1074] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1075] EXPR s->s3 [L1075] s->s3->tmp.next_state = __VERIFIER_nondet_int() [L1076] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1077] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1078] s->ctx = malloc(sizeof(SSL_CTX)) [L1079] EXPR s->ctx [L1079] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1080] s->state = 12292 [L1081] s->version = __VERIFIER_nondet_int() [L1082] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1083] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1084] CALL ssl3_connect(s) VAL [init=1, s={-6:0}, SSLv3_client_data={4:0}] [L1090] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1091] unsigned long tmp ; [L1092] unsigned long l ; [L1093] long num1 ; [L1094] void (*cb)() ; [L1095] int ret ; [L1096] int new_state ; [L1097] int state ; [L1098] int skip ; [L1099] int *tmp___0 ; [L1100] int tmp___1 = __VERIFIER_nondet_int(); [L1101] int tmp___2 = __VERIFIER_nondet_int(); [L1102] int tmp___3 ; [L1103] int tmp___4 ; [L1104] int tmp___5 ; [L1105] int tmp___6 ; [L1106] int tmp___7 ; [L1107] int tmp___8 ; [L1108] long tmp___9 ; [L1110] int blastFlag ; [L1113] blastFlag = 0 [L1114] s->state = 12292 [L1115] s->hit = __VERIFIER_nondet_int() [L1117] tmp = __VERIFIER_nondet_int() [L1118] cb = (void (*)())((void *)0) [L1119] ret = -1 [L1120] skip = 0 [L1121] tmp___0 = (int*)malloc(sizeof(int)) [L1122] *tmp___0 = 0 [L1123] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7] [L1123] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1124] EXPR s->info_callback [L1124] cb = s->info_callback [L1132] EXPR s->in_handshake [L1132] s->in_handshake += 1 [L1133] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7] [L1146] COND TRUE s->state == 12292 [L1249] s->new_session = 1 [L1250] s->state = 4096 [L1251] EXPR s->ctx [L1251] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1251] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1256] s->server = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7] [L1257] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7] [L1262] EXPR s->version VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, s->version=-5, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7] [L1262] COND FALSE !((s->version & 65280) != 768) [L1268] s->type = 4096 [L1269] EXPR s->init_buf VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, s->init_buf={0:-11}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7] [L1269] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1281] tmp___4 = __VERIFIER_nondet_int() [L1282] COND FALSE !(! tmp___4) [L1288] tmp___5 = __VERIFIER_nondet_int() [L1289] COND FALSE !(! tmp___5) [L1295] s->state = 4368 [L1296] EXPR s->ctx [L1296] EXPR (s->ctx)->stats.sess_connect [L1296] (s->ctx)->stats.sess_connect += 1 [L1297] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967342, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, s->s3={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-14}, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1161] COND TRUE s->state == 4368 [L1301] s->shutdown = 0 [L1302] ret = __VERIFIER_nondet_int() [L1303] COND TRUE blastFlag == 0 [L1304] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, buf={0:-14}, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1308] COND FALSE !(ret <= 0) [L1313] s->state = 4384 [L1314] s->init_num = 0 [L1315] EXPR s->bbio [L1315] EXPR s->wbio VAL [={0:-2147483648}, blastFlag=1, buf={0:-14}, init=1, ret=15, s={-6:0}, s={-6:0}, s->bbio={0:17}, s->wbio={0:18}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1315] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967342, blastFlag=1, buf={0:-14}, init=1, ret=15, s={-6:0}, s={-6:0}, s->s3={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=1, buf={0:-14}, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, buf={0:-14}, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-14}, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-14}, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-14}, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-14}, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-14}, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-14}, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-14}, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-14}, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1167] COND TRUE s->state == 4384 [L1323] ret = __VERIFIER_nondet_int() [L1324] COND TRUE blastFlag == 1 [L1325] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1329] COND FALSE !(ret <= 0) [L1334] s->hit VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1334] COND FALSE !(s->hit) [L1337] s->state = 4400 VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1339] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967342, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1173] COND TRUE s->state == 4400 [L1343] EXPR s->s3 [L1343] EXPR (s->s3)->tmp.new_cipher [L1343] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=4294967335, (s->s3)->tmp.new_cipher={-9:0}, blastFlag=2, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1343] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1346] ret = __VERIFIER_nondet_int() [L1347] COND TRUE blastFlag == 2 [L1348] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1352] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1358] s->state = 4416 [L1359] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967342, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1179] COND TRUE s->state == 4416 [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 3 [L1365] blastFlag = 4 VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11] [L1369] COND FALSE !(ret <= 0) [L1374] s->state = 4432 [L1375] s->init_num = 0 [L1376] tmp___6 = __VERIFIER_nondet_int() [L1377] COND FALSE !(! tmp___6) VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967342, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1185] COND TRUE s->state == 4432 [L1386] ret = __VERIFIER_nondet_int() [L1387] COND FALSE !(blastFlag == 5) VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1392] COND FALSE !(ret <= 0) [L1397] s->state = 4448 [L1398] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967342, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->s3={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1185] COND FALSE !(s->state == 4432) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1188] COND FALSE !(s->state == 4433) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=22, s={-6:0}, s={-6:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1191] COND TRUE s->state == 4448 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=-19, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] [L1658] reach_error() VAL [={0:-2147483648}, blastFlag=4, buf={0:-14}, init=1, ret=-19, s={-6:0}, s={-6:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-13:0}, tmp___1=1, tmp___2=7, tmp___4=10, tmp___5=11, tmp___6=-18] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 104.8s, OverallIterations: 26, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 93.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 26 mSolverCounterUnknown, 2598 SdHoareTripleChecker+Valid, 63.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2598 mSDsluCounter, 10848 SdHoareTripleChecker+Invalid, 63.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6002 mSDsCounter, 573 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10590 IncrementalHoareTripleChecker+Invalid, 11189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 573 mSolverCounterUnsat, 4846 mSDtfsCounter, 10590 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1287occurred in iteration=23, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 3387 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2323 NumberOfCodeBlocks, 2323 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2155 ConstructedInterpolants, 0 QuantifiedInterpolants, 5914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 1928/1928 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-27 10:19:35,860 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...